Method and apparatus for generating a set of signals representing a curve

ABSTRACT

A method and system is shown for encoding data representing knots on an outline defined relative to a coordinate plane and for generating a series of signals representing nodes on the locus of a curve partially defined by said set of knots, involving, selecting sets of coordinates on said outline, to represent said knots, establishing a successive order of said knots, encoding said knots in a data order indicative of said knot order, and encoding a complete information set of data providing a code indicative of a predetermined shape of said outline between a pair of said knots or a complete information set providing the coordinate distances between adjacent knots.

This application is related to applications with Ser. Nos. 649,040,649,011, 649,095, 649,021, 649,088, 649,012, and 649,096, all filed onthe same day as this embodiment and all assigned to Allied Corporation.

FIELD OF THE INVENTION

This invention relates to the field of encoding data related to avariable size character for access and display, and particularly, to theencoding of display points projected in the shape of a continuous smoothcurve. The field of this invention is the field of character and symbolgeneration with continuous and smooth outline curves.

DESCRIPTION OF THE PRIOR ART

The prior art contains many examples of character generating methods andsystems. One such example is U.S. Pat. No. 4,029,947 ('947) whichgenerates characters from a single encoded master but uses straight lineinterpolation to approximate curves between a set of given points. Otherencoding systems are shown in U.S. Pat. No. 4,298,945 ('945) and U.S.Pat. No. 4,199,815 ('815) which also show a system of encoding straightlines using the end points and then interpolating points on the locus ofstraight lines between the end points and about the outline of acharacter. A further patent is U.S. Pat. No. 4,338,673 ('673), whichstores a character in a single size by encoding straight line outlinesof the character and then uses that encoding to generate points alongstraight line approximations of the outline at a desired size, as in the'945 patent and the '185 patent.

However, these and other curve generation techniques do not use a systemwhereby the coordinate points on the outline of a character are encodedin a single master and then, by utilizing a parametric cubic expressionof a single variable, a series of signals describing nodes on the locusof a smooth continuous curve between those points, are generated fordisplay of the character at any variable size.

Parametric cubic curves are known and shown in "Fundamentals ofInteractive Computer Graphics", J. D. Foley and Andries Van Dam; AddisonWesley, Reading Mass, 1982. Shown therein are parametric cubic curves,as functions of a single variable, used to represent curve surfaces.

Further, T_(E) X and METAFONT, Donald E. Knuth; American Math Society,Digital Press, Bedford, Mass., 1979, shows the use of a parametric cubiccurve wherein, given the coordinate positions of a set of end points andthe first derivative (slope) of a curve at the end points, a parametriccubic polynomial (a function of a single parameter t), can be used togenerate the locus of points on a smooth continuous curve segmentbetween those end points. As shown by Knuth, the locus of each curvesegment depends on the location of the two end points of that segment,for example, Z₁ and Z₂, and the angle of the curve at Z₁, determined bythe location of adjacent points Z₀, Z₂ and Z₃. In fitting the curvebetween two end points, the angles at Z₁ and Z₂ are predetermined byKnuth. For example, where the curve is from Z₀ to Z₁ to Z₂, Knuthassumes, as a rule, the direction the curve takes through Z₁ is the sameas the direction of the arc of a circle from Z₀ to Z₁ to Z₂. However,not all curved outlines will satisfy this rule and, in many cases, Knuthrequires a further adaptation of that foregoing process to produce thedesired shape, namely of a curve representing the actual smooth curvedoutline of a character.

Knuth's process starts using the rule described above specifying acircle when fitting a curve between three given points Z₁, Z₂, Z₃. Knuthdoes show that a parametric cubic curve as a function of a singleparameter t, as also shown in "Fundamentals of Interactive ComputerGraphics", can be modified, as shown on page 20 of Knuth, to include"velocities" specified as "r" and "s" and which are functions of theentrance angle and exit angle of the curve segment at the given endpoints. The velocities' values determine how the resulting curve willvary as a function of t, either slowly describing a longer curvedistance or more quickly describing a shorter curve distance. The r ands formulas are arbitrary and, in the case shown by Knuth, are chosen toprovide excellent approximations to circles and ellipses when θ equals φand θ+φ equals 90 degrees. Additional properties chosen to be satisfiedby Knuth's arbitrary formulas for r and s are further described in T_(E)X and METAFONT.

In addition to Knuth's internal requirement to specify an entrance andexit angle at the curve end points, where no previous angle or curvehistory is given, Knuth also must use the circle approximation rule,specified above, for each of the end points on the curve. This meansthat where the actual curve to be generated is not accurately producedby the Knuth circle approximation, an adjustment must be made. Knuthmakes this adjustment by manipulating adjoining points. For example,where the curve is to be fit between points Z₁, Z₂ and Z₃. Knuth maymanipulate the locations of Z₀ or Z₁ or Z₃ or Z4 to obtain an accuratefit. A further problem in Knuth occurs when the sign of θ is the same asthe sign of φ implying (a) the curve entrance angle at point Z₁ is inthe same quadrant as the curve exit angle at Z₂, (b) a sine wave betweenZ₁ and Z₂ and (c) an inflection point. Knuth must resort to amanipulation of point locations to obtain a desired smooth curve aroundthe reflection point.

In summary, the processes described above for producing outlines andshowing the use of a parametric cubic curve expressed as a polynomialcapable of generating a series of points along the locus of a curvebetween two given points can only do so with the disadvantages notedabove. In the following summary of the invention, the method and systemfor using a parametric cubic curve which accurately reproduces a curvesection between given points is shown and described and which method andsystem avoids the disadvantages discussed above.

SUMMARY OF THE INVENTION

This invention has as its object the generation, encoding and display ofa series of points (nodes) along the locus of a curve segment betweentwo given end points which are defined as "knots". It has beenspecifically developed to generate the locus of points (nodes) along thesmooth curved outline of characters or symbols between given knots(i.e., Z_(a-1), Z_(a), Z_(a) +1 . . . Z_(n-1), Z_(n)), but it should beunderstood that its use is not necessarily limited to that purpose butmay be used to generate and display smooth continuous curves between anyend points, regardless of the application.

In the case of the applicant's preferred embodiment, the knots arecoordinate points along the outline of a character, shich may be analphanumeric or any other character or symbol and which coordinatepoints may be representative of a master size encoded character at anormalized size, on a dimensionless normalized encoding grid. Thecoordinate points may be decoded for display at a predeterminednormalized display size or at an expanded or reduced size. The knots maybe along any outline or surface whether two or three dimensional,although the applicant's preferred embodiment is shown in atwo-dimensional model for use in smooth continuous curve generation.Using the method and system of applicant, the nodes along atwo-dimensional curve or three-dimensional surface locus may begenerated. The system shown herein generates the nodes using the encodedknot positions and the slopes of the curve at the knots. The processgenerates signals representing the nodes's coordinate values and isbased upon the length (Z) between the knots and the angularinterrelationship (B) of each of the knots with respect to a referenceangle on the encoding grid.

In the preferred embodiment, the knots' coordinates are encoded in aclosed data loop and represent dimensionless coordinates about theclosed outline loop of the character or symbol. The method describedherein enters the closed data loop at a set of encoded coordinatesrepresenting a knot on the closed outline loop and initiates the nodegenerating process by using the angular interrrelationships of the knotsabout that entry knot. However, other methods may be used to initiatethe process without departing from the inventive concept. In applicant'spreferred embodiment, once having entered the encoded closed data loop,the analysis may proceed in a clockwise or counterclockwise directionaround the closed data loop.

It should be understood that the principles of this invention are notlimited to a closed outline loop or closed data loop, but may be appliedto open outline loops and to open data loops.

The process may be used to generate either a smooth continuous curvebetween the knots or some other form of curve, forming a cusp at a knotfor example, and which although continuous, it is not smooth at alllocations but angular, as in the shape of a "K" or "G". In the preferredembodiment of the invention, the selection of a smooth continuous curveor merely a continuous curve, having a cusp for example, is made usingstored rules which serve as default command codes which use theinterknot angles formed between the knots, and the distance between theknots to produce a desired result. For example, where the angle formedby two knots is in excess of a predetermined threshold angle, a defaultcommand code may direct that a cusp be formed. Other rules such asoverride control codes may be similarly used to force a cusp or smoothcurve, regardless of the threshold conditions and which may be encodedin the closed data loop to override the default command codes asexplained below.

Assuming, for the purpose of explaining the invention, it is desired toconnect all knots in the closed outline loop with smooth continuouscurves, the angles formed between an entrance knot at which therepresentative encoded data loop is entered and the first and secondsuccessive knots thereto in a chosen progression of knots in the closedoutline loop are averaged to produce average angle values. As the curveformed between knots is a continuation of a curve which enters at thefirst of the knots (Z_(a)), and which exists at successive or at asecond of the knots (Z_(a+1)), the tangent angles of the curve, whichare the entrance angle at the first knot and exit angle at the secondknot can be specified as average angles. The analysis continues byproceeding around the closed outline loop in the established progressionof knots and the order thereof of the knots and examining the anglesformed between the knots as described above.

As the knots form a master skeletal outline of the character or symbolwhen juxtaposed on a dimensionless encoding grid, arranged at anormalized size, the knots may be rotated or scaled relative to such anormalized encoding grid. Once the master encoded character or symbol(master encoded character) is scaled and positioned as desired, then theanalysis described above, may continue wherein (a) the encoded closeddata loop of knots in the closed outline loop is entered at a first setof coordinates representing a first knot, (b) the angular and spacialrelationships of the knots on the normalized encoding grid aredetermined, using the representative encoded data and (c) for each setof knots along the closed outline loop, assuming that each knot is to beconnected by a continuation of a smooth curve, the average angles of therespective curve segments entering and exiting the respective knots aredetermined. Where a smooth continuous curve is desired, then theentrance angle of the curve segment at a knot would normally be the sameas the exit angle of the curve from that same knot.

By using the foregoing method of analysis, namely, determining theaverage angles made by the curve passing through the knots, and usingthose average angles to represent the slope of the tangents to theparticular curve segment at the respective knots, the disadvantagesshown in the prior art are overcome.

In particular, in this inventive concept, there is no need to define acircle between the knots and then compute the locus of nodes on thecircle as Knuth does. A faster process results using this inventionwhich requires only the interknot angles of the knots relative to eachother and to a reference angle be known. The process as stated above,uses a parametric cubic polynomial relationship of a single variable tto generate signals or data, indicative of and representing thecoordinates of nodes on the locus of a smooth continuous curve segmentbetween sets of respective knots. Where a greater resolution and greaternumber of nodes is needed to describe the locus, then the incrementalvalue of the parameter t, may be decreased providing a greater number ofdiscrete cumulative values of t and node coordinates. Where lessresolution and fewer nodes are needed to define the locus, then theincremental value of t can be enlarged, producing fewer discretecumulative values of t and nodes.

In the preferred embodiment, the dimensionless normalized masterencoding grid represents an EM Square (M²) of 864 to 864 DimensionlessResolution Units (DRU's) in each of the X, Y axes. The M² is a measureused in the typesetting trade wherein a character is set withon an M²and is shown herein in a manner consistent with the application of theinventive principles in the preferred embodiment. When the masterencoded character is to be displayed, the master encoded character, at anormalized size on the normalized encoding grid is scaled, the knotcoordinate positions at the scaled size are encoded and expressed in theappropriate display intercept units such as Raster Resolution Units(RRU's). These scaled encoded knots in the preferred embodiment areexpressed in terms of the display RRU's and used to determine theincremental value of t. The incremental value of t is used to generatediscrete cumulative values of t which are then applied to the cubicparameteric polynomial to generate the node coordinates. Then throughthe cubic parametric polynomial relationship, signals indicative of thecoordinates of the nodes are generated and stored as data. As defined bya parametric expression of a single parameter t, the resultant node's x,y coordinate values (X or Y are the axial directions in the preferredembodiment), vary separately as separate functions of t [i.e. x(t),y(t)]. At the scaled size, the incremental value of t may be related tothe reciprocal of the distance between knots expressed in RRU's (i.e.Z_(d) =|Z_(n) -Z_(n-1) |) or any other suitable method may be used toproduce a value of t. Values representing the node coordinates are thengenerated using these incremental values of t, each value being added,to the previous cumulative values (with the second incremental value oft being added to the first incremental value of t and the thirdincremental value of t being added to the previous cumulative value of tand so on). In the preferred embodiment, the value of t is set to varyfrom 0 to 1.

The resulting series of signals, stored as encoded data, represent knosand nodes which define the locus of the smooth continuous curve betweenthe knots and the outline of the character or symbol is a machine partultimately used to control or modulate a display to form the desiredcharacter or symbol at the desired size, in a visual image. Theresultant data may be run length data, which is applied directly to araster beam, to position the beam and energize the beam accordingly, ormay be used to control a free running raster. Interpolation, rounding ortruncating of value may be used to locate the nodes on the displayintercepts corresponding to the raster line locations, where exactcoincidence is lacking.

As previously stated, as characters or symbols are not always smoothcurves but may contain cusps, a threshold test may be used, such as onebased on the exterior angle formed by lines between knots. Where thatexterior angle at a knot is greater than a predetermined thresholdangle, for example, a cusp may be assumed. It being understood, however,that if the exterior angle is less than the threshold angle, theanalysis previously described with regard for producing locus of nodesto define a smooth continuous curves would be used.

In the preferred embodiment, the master encoding grid is a Cartesiancoordinate system. As the preferred embodiment is used in typesetting,the encoding grid relative to which the character is encoded is setwithin an M², which in the preferred embodiment contains 864 by 864Dimensionless Resolution Units (DRU's). The master encoded character, atits normal size is set over a portion of the available normalizedencoding grid area of the M². As is known in the typesetting field,expansion areas in the M² are also provided for large size characters.The character may be scaled, rotated or projected by ordinary knowntechniques and new coordinates for the knots may be determinedaccordingly, as is known in the art. In the preferred embodiment, thescaling is done in increments of 1/1024 DRU's. The new coordinatelocations of the knots for the character at its scaled, rotated orprojected positions are determined. As only integers are used in thepreferred embodiment, any fraction or equivalent thereof is discarded.In the process, the percent of reduction or enlargement is firstcalculated in relation to a desired character size in units oftypesetter's points. The precision of the scaling is increased by anautoscaling linear interpolation increaseing the resolution of thelinear interpolation, as explained below. The result is a scaledcoordinate point in RRU's without the need to utilize floating pointarithmetic.

In the preferred embodiment and as stated above, override control codesare accessed responsive to data stored with the stored knot coordinatesto reduce storage and the processing time.

The code 0 is used to indicate the end of all the loops.

A code 1 is used to indicate the movement in a relatively long directionon an axis, for example, the X axis. In this case, an X value isreplaced with a new X coordinate value.

The code 2 indicates the same process as a code 1 for another axis, forexample, the Y axis direction, where the Y value is replaced with an newY coordinate value.

A code 3, as in codes 1 and 2, indicates X and Y are both replaced withnew coordinate values.

A code 4 indicates the finish of a previous encoded loop and the startof a new loop.

Codes 5, 6 and 7 indicate that the X,Y or XY directions are respectivelyaltered.

Codes 8 to 11 are editing commands forcing predetermined conditions forthe curve at the respective knots as will be described.

The knots may be encoded in the closed data loop on a 4-bit memoryboundry (nibble) and in the preferred embodiment, the first nibble valueof a complete information set of nibbles is used to specify the numberof nibbles used in the complete information set.

Additionally, the data is packed in a novel manner which can beinterpreted as spacial information or control codes, as will beexplained.

In summary, the inventive concept is a process and system fortransforming a machine part, in the form of signals, encoded as data andrepresenting a pattern of knots on the outline of a master size symbol,into a similar pattern at a reduced or enlarged size or transposed inspace, by generating a series of encoded data signals representing nodeswhich more definitely define the said pattern in the shape of smoothcontinuous curves or cusps and which data signals may be directly usedto control a display process to visually display the pattern.

Accordingly, what is disclosed is a method and system for generating aseries of signals representing nodes on a locus of a curve partiallydefined by as set of related knots, encoded as data, with said knotsdefining the end points of respective segments of said curve locus andwith said knots being in a successive order in relation to said locus,and for encoding said node signals as data for use when representingsaid curve segments in a separate additional process responsive to theshape of said curve locus, as represented by said encoded node signals.The method and system involve defining the locations and the successiveorder of said knots on said curve locus and encoding as data, signalsindicative of said knots, then for a first knot, (Z_(a)), representing afirst end point of a first curve segment, deriving a first angle,indicative of the average of the interknot angles between said firstknot (Z_(a)), and selected related knots and encoding as data, signalsindicative of said first angle, at a second of said knots (Z_(b)),representing a second end point of said first curve segment,establishing a second angle for said first curve segment, and encodingas data, signals indicative of said second angle, establishing acompiler for compiling data according to a cubic parametric polynomialrelationship between a parameter "t", said knots and angles at the saidend points of a said curve segment and the locus of a said curvesegment, establishing a range "R" of values for said parameter "t",applying said signals indicative of the said locations of said first andsecond knots of said first curve segment, to said compiler, applyingsaid signals indicative of the said first and second angles of saidfirst curve segment to said compiler, applying a signal indicative of adistinct selected value of said parameter "t" within said range "R", tosaid compiler to derive a signal indicative of a respective nodelocation on said first curve segment, repeating the above by applyingsignals indicative of additional distinct selected values of saidparameter "t", within said range "R", to derive a plurality of signalsindicative of respective node locations on said locus of said firstcurve segment for respective distinct selected values of said parameter"t", and encoding said signals derived in step (h) and (i), in a database to represent said first curve segment.

Further disclosed is a method of encoding data and an encoded datasystem representing knots on an outline defined relative to a coordinateplane involving selecting sets of coordinates on said outline, torepresent the knots, establishing a successive order of said knots,encoding said knots in a data order indicative of said knot order, andencoding by encoding a complete information set of data providing acontrol code indicative of either (i) the coordinate locations of saidknots or (ii) a knot's direction relative to others of said knots or(iii) a predetermined shape of said outline between a pair of said knotsor (iv) data indicative of the shape of said outline at a knot or (v)encoding a complete information set providing the coordinate distancesbetween adjacent knots.

Further disclosed is a method and system for encoding data representingknots on an outline defined relative to a coordinate plane and forgenerating a series of signals representing nodes on the locus of acurve partially defined by said set of knots, involving selecting setsof coordinates on said outline, to represent said knots, establishing asuccessive order of said knots, encoding said knots in a data orderindicative of said knot order, and encoding a complete information setof data providing a code indicative of a predetermined shape of saidoutline between a pair of said knots or a complete information setproviding the coordinate distances between adjacent knots.

Further disclosed is a method and system for generating a series ofsignals representing nodes on a locus of a curve partially defined by aset of related knots, encoded as data, with said knots defining the endpoints of respective segments of said curve locus and with said knotsbeing in a successive order in relation to said locus, and for encodingand decoding said node signals as data and for use of said data when inan imaging process responsive to the shape for said curve segments asrepresented by said encoded data, involving defining the locations andthe successive order of said knots on said curve locus and encoding asdata, signals indicative of said knots, for a first knot, (Z_(a)),representing a first end point of a first curve segment, deriving afirst angle, indicative of the average of the interknot angles betweensaid first knot (Z_(a)), and selected related knots and encoding asdata, signals indicative of said first angle, at a second of said knots(Z_(b)), representing a second end point of said first curve segment,establishing a second angle for said first curve segment, and encodingas data, signals indicative of said second angle, establishing acompiler for compiling data according to a cubic parametric polynomialrelationship between a parameter "t", said knots and angles at the saidend points of a said curve segment and the locus of a said curvesegment, establishing a range "R" of values for said parameter "t",applying said signals indicative of the said locations of said first andsecond knots of said first curve segment, to said compiler, applyingsaid signals indicative of the said first and second angles of saidfirst curve segment to said compiler, applying a signal indicative of adistinct selected value of said parameter "t" within said range "R", tosaid compiler to derive a signal indicative of a respective nodelocation on said first curve segment, repeating the above by applyingsignals indicative of additional distinct selected values of saidparameter "t", within said range "R", to derive a plurality of signalsindicative of respective node locations on said locus of said firstcurve segment for respective distinct selected values of said parameter"t", encoding said signals derived above in a data base to representsaid first curve segment accessing said data base signals, andcontrolling an imaging means responsive to said accessed signals toreproduce said curve.

Further disclosed is a method and system for linear interpolation ofcoordinate points between first and second end points, to producecoordinates on a straight line outline and where said coordinates arelocated on a coordinate system having a first coordinate direction andsecond coordinate direction and encoded in machine readable data words aradix "r", corresponding to the order of values for designated positionsin said data words, involving encoding a first data word of "N"positions corresponding to the distance between the said first andsecond end points in the said first coordinate direction and placingsaid first data word into a first machine location, encoding a seconddata word of "M" bits corresponding to the distance between said firstand second end points in said second coordinate direction and placingsaid second data word into a second machine location, determining thenumber of available positions, between the most significant position ofsaid first data word and the most significant position of said firstmachine location, available for shifting said first data word in a firstdirection of the most significant positions of said first machinelocation, shifting said first data word by a maximum number ofpositions, equal to the said number of available positions in said firstdirection and the number of positions corresponding to the number ofsignificant positions used to encode said second data word, andincreasing the scale of said first data word by a scale factor relatedto the number of said positions shifted, deriving a third data wordindicative of said second data word in said second machine locationdivided into said first data word shifted according to step (d),encoding data words indicative of the coordinate of said straight linein said second coordinate direction, for respective ones of said datawords encoded according to step (f) encoding a multiple of said thirddata word, which are related to a respective coordinate in said firstcoordinate direction, on said straight line, reducing the scale of saidmultiples of said third data words above, to the scale of the first dataword established prior to the above said shifting and encoding saidthird data words produced above with respective coordinates in saidsecond coordinate direction to produce said coordinates on said straightline.

Further disclosed is encoding data representing knots on an outlinedefined relative to a coordinate plane and for decoding said encodingdata for use in a display process to produce images of said outlinesrepresented by said encoded data by selecting sets of coordinates onsaid outline, to represent said knots, establishing a successive orderof said knots, encoding said knots in a data order indicative of saidknot order, the encoding including encoding a complete information setof data providing a control code indicative of either (i) the coordinatelocations of said knots or (ii) a knot's direction relative to others ofsaid knots or (iii) a predetermined shape of said outline between a pairof said knots or (iv) data indicative of the shape of said outline at aknot, or (v) providing data indicative of the coordinate distancesbetween adjacent knots, decoding said complete information sets in adecoding order related to said data order responsive to said completeinformation set being indicative of the coordinate distances betweenadjacent knots, producing an image of a smooth continuous curved outlineor a straight line between said adjacent knots or, responsive to saidcomplete information set being indicative of a said control code, as setforth in (i), (ii), (iii), or (iv), producing an image of a smoothcontinuous outline or a straight line according to the said coordinatelocations of said knots relative to adjacent knots in said successiveknot order or producing an image of said outline being smooth atrespective knots or being sharp and forming cusps at respective knots.

Further disclosed is encoding data representing knots on an outline loopdefined relative to a coordinate plane, for producing a display image ofsaid outline and decoding responsive to the interrelationship of saidknots on said outline loop, and imaging said outline loop responsive tosaid decoded data involving selecting sets of coordinates on saidoutline loop, to represent said knots, establishing a successive orderof said knots, encoding said knots in a data order indicative of saidknot order, encoding a complete information set of (i) data indicativeof the coordinate distances and interknot angles between adjacent knots,comparing the relative positions of successive knots to at least a firstinterknot criterion, responsive to said step (d) of comparing, (i)producing a first indication that a set of said successive knots iswithin said criterion, or (ii) producing a second indication that a setof said successive knots is outside said criterion, and (i) responsiveto said first indication imaging said outline loop in the form of asmooth continuous curve, or (ii) responsive to said second indication,imaging said outline loop in the form of a straight line, between saidset of successive knots.

Further disclosed is encoding and accessing a single data set ofsolution values functionally related to and representing the solutionset to at least two domains of a variable, involving defining a singledata set of solution values functionally related to a first domain of avariable and to a second domain of a variable, arranging said data setof solution values in an order related to said first domain and saidsecond domain, accessing said data set of solution values relative torespective values in said first domain to derive at least a part of saidsolution set to said first domain, and accessing said data set ofsolution values relative to respective values of said second domain toderive at least a part of said solution set to at least said seconddomain.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1a shows a set of knots (i.e. Z_(a), Z_(a+1), Z_(a+2), . . . )forming the skeletal outline of a master encoded character.

FIG. 1b shows the closed outline loops with reference to a character.

FIG. 1c shows curve segments Z_(a-1), Z_(a), Z_(a), Z_(a+1), and curveZ_(a+1), Z_(a+2) and the relationships of the deviance angles θ and φ,at knot Z_(a) and Z_(a+1).

FIG. 1d and FIG. 1e shows in greater detail the deviance angles of thecurve segment Z_(a), Z_(a+1), at the respective entrance and exit knots,as functions of the interknot angle (B) and the entrance and exitangles, and

FIG. 2 shows the relationships of the knots, tangent angles and anglesand to a curve, for the purpose of explaining the Hermite interpolator.

FIG. 3 shows a master encoding grid as may be used in the preferredembodiment, at a normalized size, for encoding a character or symbolsuch as the character G shown in FIG. 3, as a master encoded character,at a normalized size.

FIG. 4 shows the manner a look-up table may be arranged so access in onedirection would provide a value equal to T₂, as explained herein, and inthe opposite direction, a value of T₃, as explained herein.

FIG. 5 shows the angular relationships between a set of knots Z_(a), andZ_(a+1) when a sharp knot or cusp is to be produced.

FIG. 6a shows the angular relationships at a set of knots when a knotbetween a straight line and a curve is desired to be smooth.

FIG. 6b shows the angular relationships at a smooth knot, and between acurve line and a straight line.

FIG. 7a shows the angular relationships at a knot between a curve lineand straight line, forced by a control code to override a defaultcommand code, which otherwise would produce the results shown in FIG.7b.

FIG. 8 shows the angular relationships about a set of knots Z_(a) andZ_(a+1) when it is desired that a smooth continuous curve pass betweenthe knots.

FIG. 9 shows a character as may be produced according to the principlesof the invention.

DESCRIPTION OF THE PREFERRED EMBODIMENT

As stated in the summary, the object of this invention is to generate aseries of display signals, representing nodes describing the locus of asmooth continuous curve at a desired size, from a normalized curveencoded as a set of encoded knots. Normalized is used in its general andordinary meaning to denote a norm or standard size. However, as would beapparent to those skilled in the art, the display curve, described interms of display intercept coordinates (RRU's), is dependent upon theresolution of the display, and the rate or relationship between thenumber of raster resolution units (RRU's) at a given display resolutionto the dimensionless resolution units (DRU's) in which the curve isencoded at its normalized size and on the normalized grid. Thenormalized encoded curve may also be thought of as a master which isencoded at a master size relative to the master encoding grid which mayhave any suitable coordinate system and which after scaling, may be usedto generate the encoded data representing display intercepts in rasterunits, at a given raster resolution for any desired display sizecharacter. As the inventive concepts disclosed herein are used in thetypesetting industry to produce typeset composition containingcharacters having curved outlines in conformance to the highest graphicstandards, scaling starts with a determination of the desired size ofthe character in any chosen system of measurement. In the preferredembodiment character size is expressed in printer's points (351.282micrometers/point of 0.01383 inches/point). It being understood,however, that the invention can be used in connection with other unitsof measurements and with applications outside the printing ortypesetting industry, without deviating from or changing the inventiveconcepts shown herein. The invention, as described herein is withreference to the printing industry, where the master encoding grid ismade synonymous with a dimensionless encoding grid in the form of atypesetting M². This is the application of the preferred embodiment ofthe invention and discloses the best mode of using the invention.

The problem solved by this invention may be best considered by viewingFIG. 1a which shows a series of data encoded knots (Z_(a-1), Z_(a),Z_(a+1), Z_(a+2) . . . ) on a dimensionless encoding grid havingcoordinates in the X and Y axial directions, with the X directioncoinciding with a zero degree (0°) reference angle. It should beunderstood, however, that any system of coordinates can be used with anyreference angle chosen without changing the manner in which theinventive concepts are used.

As shown in FIG. 1a, a number of knots Z_(a-1), Z_(a), Z_(a+1), Z_(a+2),Z_(a+3) inclusive to Z_(a-n) represent an outline loop which may besmooth and continuous over a series of such knots or continuous withoutbeing smooth over a series of such knots or a combination of theforegoing. As stated, the knots represent the skeletal outline of apredetermined normalized or master size character or symbol (hereinafterreferred to as master size character), on a juxtaposed dimensionlessencoding grid where the coordinates have dimensions of DimensionlessResolution Units (DRU's). In the case of the encoded character, themaster size is with reference to the normalized encoding grid and thearea within the grid. The interknot angles between the knots, withreference to the reference angle, are shown as generally denoted by "B"and particularly as B_(a-1), B_(a), B_(a+1) and so on for the interknotangles at respective knots Z_(a-1), Z_(a), Z_(a+1) and so on. FIG. 1ashows a skeletal outline as may be typically used for symbol wherein allthe knots Z_(a-1) through Z_(a-n) on the symbol outline are arranged ona closed outline loop. This relationship in its simplest form could beshown by the knots for the outline of an O or D, encoded with two suchclosed outline loops, for the exterior closed outline loops 11 and 15and one for the interior closed outline loops 13 and 17 respectively, asshown in FIG. 1b.

As shown in FIG. 1a, a direction of progression of the curve outline ischosen with reference to an defined by the order of the knots around theoutline. That progression of the curve locus and order of knots is shownby numeral 19 in FIG. 1a. The chosen order of knots defining the saidprogression, (i.e. Z_(a-1), Z_(a), Z_(a+2) . . . Z_(a-n)) establishes anoutline loop of knots. That outline loop may be a closed outline loopwhich ends upon itself, as shown in FIG. 1b, by closed outline loops 11,13, 15 and 17. As will be explained below, a compiler functioningaccording to a parametric cubic polynomial is used to generate signalsindicative of nodes which are the coordinates of locations on the locusof a smooth continuous curve between the knots. The order of the knots,defines an outline loop and the respective order of the nodes by theirlocations relative to the knots and to each other on the outline loop,as would be apparent to one skilled in the art. As explained below, thedata representative or indicative of these knots and nodes are encodedin a data order indicative of the order of the knots and nodes on theoutline loop. This data order establishes a data loop. As furtherexplained below, the data loop may be designed to close upon itself sothat the ending data location for the data loop is the starting datalocation where data was accessed therefrom in the encoding process andforming a closed data loop corresponding to the closed outline loop.

As stated above, the knots Z_(a), Z_(a+1), etc., may be encoded in theCartisian coordinate system as X-Y points, using as a reference thenormalized encoding grid, or may be encoded in any other system ofcoordinate points. The outline between the knots is not encodedinitially as it will be represented by a generated series of nodes andwhich will represent the smooth continuous curve locus of the outline,according to the principle of the invention. The display interceptvalues for the nodes on the curve locus, at a predetermined displaysize, are related to the encoded knots on the dimensionless encodinggrid shown in FIG. 1a by a parametric cubic polynomial relationship.Since the invention is used in a two-dimensional system, the parametricrepresentation represents the curve locus of such nodes Z(X,Y)independently as a third order polynomial function of a parameter "t"which is independent of the encoding grid coordinates. In the preferredembodiment, the parametric cubic polynomial is shown in a Hermite form,it being understood that those skilled in the art can use other formsfor defining the polynomial such as the Bezier form, defined in"Fundamentals of Interactive Computer Graphics", referred to in theforegoing, and to which the improvements of this invention areapplicable.

The parametric representation of a curve is one for which X and Y arerepresented as a third order (cubic) polynomial relationship of aparameter "t" where:

    x(t)=a.sub.x t.sup.3 +b.sub.x t.sup.2 +c.sub.x t+d         1.1

    y(t)=a.sub.y t.sup.3 +b.sub.y t.sup.2 +c.sub.y t+d         1.2

The Hermite representation of the parametric cubic polynomial uses thecoordinate positions, of the knots, and the tangent angles at the knots,such as Z_(a), Z_(a+1), etc. The Bezier representation uses thepositions of the curve's end points and two other points to define,indirectly, the tangents at the curve's end points. The improvements ofthis invention shown herein are applicable to any representation by theparametric cubic polynomial which uses the position of the curve's endpoints and the tangent angles of the curve at the end points, directlyor indirectly. For sake of explanation, only the Hermite form will bediscussed.

As shown in FIG. 2, given end points P₁, P₄ and the respective tangentvectors R₁, R₄ at the two end points P₁, P₄ and along the smoothcontinuous curve segment 18, a cubic parametric polynomial relationshipbetween a parameter "t" and the locus of a curve segment 18, between apair of end points, P₁, and P₄, may be represented as the followingrelationships below.

    x(t)=P.sub.1x +(3t.sup.2 -2t.sup.3)(P.sub.4x -P.sub.1x)+t(t-1).sup.2 R.sub.1x +t.sup.2 (t-1)R.sub.4x                           2.1

    y(t)=P.sub.1y +(3t.sup.2 -2t.sup.3)(P.sub.4y -P.sub.1y)+t(t-1).sup.2 R.sub.1y +t.sup.2 (t-1)R.sub.4y                           2.2

where (P_(1x), P_(1y)) (P_(4x), P_(4y)) are the coordinate values at P₁and P₄ respectively, and (R_(1x), R_(1y)) and (R_(4x), R_(4y)) are thetangent values at P₁ and R₄ respectively, with respect to a straightline between P₁ and P₄ thereafter called entrance and exit angles,respectively.

Cubic curves as a minimum are used, as no lower order representation ofcurve segments can provide continuity of position and slope at the endpoints where the curve segments meet, and at the same time can assurethat the ends of the curve segment pass through specific points.

The derivation of the Hermite parametric cubic polynomials are shown in"Fundamentals of Interactive Computer Graphics" and the manner of usingsuch parametric cubic polynomials to define the points along a curve arefurther discussed in T_(E) X and METAFONT referred to in the foregoing.

The Hermite form of the parametric cubic polynomial is as stated is aseries of curves as shown by Knuth in Chapter 2 in T_(E) X and METAFONTand which is written in Euler notation as

    Z(t)=Z.sub.1 +(3t.sup.2 -2t.sup.3) (Z.sub.2 -Z.sub.1)+rt(1-t).sup.2 S.sub.1 -st.sup.2 (1-t)s.sub.2                                    3.1

    S.sub.1 =e.sup.iθ (Z.sub.2 -Z.sub.1); S.sub.2 =e.sup.-iφ (Z.sub.2 -Z.sub.1); 0<=t<=1                                        3.2

and, where r and s are positive real numbers. Equations 3.1, 3.2 definea curve having directions represented by the deviance angles θ and φ atZ₁, Z₂ respectively.

The relationship shown in 3.1, 3.2 may be encoded into a compilerdesigned to process input data related to the knot locations, the anglesof the curve segment at its end points, and then for separate selectedvalues of a parameter "t" to produce signals indicative of nodelocations on the locus of the curve segment. The compiler is shown atthe end of the specification.

As stated above, the Hermite form of the parametric cubic polynomial isused in the preferred embodiment of the compiler but the principles ofthe invention can be used with any other cubic polynomical using thedirections of the curve at end points of the curve and the end pointlocations.

Assuming a curve direction for a given knot order from knot to knot, andin particular, from knot Z₁ to knot Z₂, with knot Z₁ being the entranceknot for curve segment Z₁, Z₂ (hereafter curve segments will be definedby the respective segment and knots such as "curve Z₁, Z₂ ") and knot Z₂being the exit knot for curve Z₁, Z₂, then θ is the angular direction ofthe curve Z₁, Z₂ at entrance knot Z₂, and φ is the direction of curveZ₁, Z₂ at exit knot Z₂. In the preferred embodiment, the interknot angle(B) made by the straight line from knot Z₁ and Z₂, is defined in termsof a reference angle given for the normalized encoding grid. Also, theangles a and g of the curve are related to that same reference angle.Therefore, the interknot angle expressed below as B and the angles ofthe curve at the entrance knot, defined below as a and the angle of thecurve at the exit knot, defined below as g, are all defined with regardto a reference angle.

As further explained below, according to the inventive principles,deviance angles θ and φ, shown used in equation 3.1 and 3.2, are thecurve entrance and exit angles a, g, respectively, defined with regardto the interknot angles B and applied to the compiler in the form of theparametric cubic polynomial, as shown in equation 3.1.

In explaining the invention, a and g are used to identify the entranceangle of a curve segment at a first knot end point and the exit anglemade by that same curve segment at a successive second knot end point,in the knot order. The first and second knots define the entrance andexit knots of the curve segment, with regard to the order of knots andthe outline loop, as explained below. However, a and g are definedrelative to a reference angle "q" on the master encoding coordinategrid. θ and φ are the entrance angle and exit angle in the cubicparametric polynomial of 3.1 and 3.2, defined relative to an interknotangle B between the entrance and exit knots (i.e. in the preferredembodiment, θ=a-B; φ=B-g). The preferred embodiment uses a process ofdefining the entrance angle a and exit angle g in terms of the interknotangles on the outline loop, and with respect to a reference angle anduses the definition of the entrance and exit angles shown as θ and φwhen applying the angles a and g, at the respective entrance and exitknots, to the compiler, as based on and as required by the derivation ofthe cubic parametric polynomial, described herein. However, the angles θand φ could be derived directly from the interknot angles B orprecomputed from the relationship of the outline loop knots and accesseddirectly without first deriving a and g and without deviating from theprinciples of the invention.

The parameter "t" of 3.1 is allowed to vary over a defined range asfurther explained below, and for each discrete selected value of t, adiscrete node on the locus of the curve between the entrance and exitknots and defined by the parametric cubic polynomial is generated by thecompiler. The nodes would be the coordinate location of points on thelocus of the curve described by equation 3.1 for each selected value of"t" and where knots Z₁ and Z₂, and the angle of the curve at thoseknots, given as a and g, derived above, was specified. The derivation ofa, B, g, θ, and φ of "t" and their relationship according to theprinciples of the invention are further explained and shown below.

It should be noted, however, that the form of the Hermite interpolatorused in the preferred embodiment imposes an opposite sign for φ thanthat shown in T_(E) X and METAFONT shown in Knuth.

It should also be noted that the deviance angles θ and φ representingthe divergence between the straight line angle interknot angle (B), asused in the cubic parametric polynomial of 3.1, 3.2.

"r" and "s" affect the curve velocities, as described below and thelength of the curve between its respective end points (i.e., curve Z₁,Z₂ between Z₁, Z₂). "r" and "s" are velocities at Z₁, Z₂ respectively, alarge velocity value meaning the curve direction changes slowly whilesmall values indicate the curve undergoing more pronounced directionalchanges [small values of r and s will then have less influence on thevalue of x(t) or y(t)]. The velocities, r and s, in T_(E) X and METAFONTare represented as ##EQU1##

Considering the effect of r and s on the curve locus defined by thenodes, produced through the cubic polynomial relationship, the values ofr and s may be limited to control the direction of the curve from theentrance knot to the exit knot. In the preferred embodiment, r and s arelimited to the values of 0.1 to 4.0. However, these values of r and scould be changed without departing from the principles of the invention.

As discussed in the foregoing, the system shown therein for using therelationship of the points along the smooth curve in T_(E) X andMETAFONT have disadvantages which are eliminated by this invention whichwill become apparent by reading the following explanation.

As explained above, in using the parametric cubic polynomialrelationship to define the nodes along a smooth curve, T_(E) X andMETAFONT start with a circle approximation rule and then must makeadjustments to produce a smooth continuous curve between given points.In this invention, those disdvantages are eliminated by the inventiondescribed in the following.

In the preferred embodiment, the sign of φ is reversed relative to theangle rotation used in T_(E) X and METAFONT.

The principles of this invention as applied to the preferred embodiment,may now be particularly seen with reference to FIG. 1a. As stated above,a skeletal outline is described by a progression of a series of knots inthe order of Z_(a), Z_(a+1) . . . Z_(n), Z_(a-1), which defines a closedoutline loop about the outline of the character or symbol. The knots areencoded as coordinate points in a closed data loop, representing theclosed outline loop. As stated, the object of the invention is toproduce a series of nodes representing display coordinates on the locusof a curve between each of the knots, the curve being smooth andcontinuous. However, as will be shown, the principles of the inventioncan be modified so a series of points describing straight lines betweenknots can be generated and smooth continuous curves can be generatedbetween knots which are interspersed with straight lines. In addition,cusps can be formed between smooth continuous curve and/or straightlines.

The smooth continuous curve is produced through the parametric cubicpolynomial relationship described above. In using the invention, thefollowing principles are applied. The data loop may be entered at thedata values representing a knot, Z_(a) for example, and the angularrelationship of the knot (Z_(a)) referenced to a preceeding knot(Z_(a-1)) and to a succeeding knot in the loop analyzed. The analysismay then proceed in a clockwise direction around the loop which may beconsidered in the forward direction. However, as stated, the analysiscan proceed in a counter-clockwise or backward direction with thedirection being used to denote or indicate other values, such as color,or other characteristics as may be needed. As will be understood, thedirections used herein are chosen for explanation and do not limit theinventive principles.

FIG. 1a represents a series of knots Z_(a), Z_(a+1), Z_(a+2) - - -Z_(a+n), Z_(a-1) arranged in a closed outline loop, encoded relative toa master encoding grid and partially defining, in skeletal form, thepoints on a closed outline loop, such as outline 11, 13, 15, or 17,shown in FIG. 1b. The interknot angles, the angles from knot to knot(i.e. from knot Z_(a-1) to knot Z_(a)) are denoted generally by theletter "B" with a subscript reference indicating that the angle isformed by a straight line from a respective knot, B_(a-1) for example,to a successive knot B_(a) in the outline loop. The terms "preceding"and "successive" can be used with reference to the defined order ofknots in the outline loop, i.e. either clockwise or counterclockwise, asthe case may be. In FIG. 1a, the knot angles B are shown as B_(a),B_(a+1), B_(a+2), and so on for respective knots.

The manner of applying the cubic parametric polynomial compiler in thepreferred embodiment to define nodes between the knots along the locusof a smooth curve utilizes the deviance angle θ at the curve entranceknot and the deviance angle φ at the curve exit knot. The devianceangles θ and φ may also be referred to as entrance and exit angles.

According to the principles of the invention, and assuming a smooth andcontinuous curve segment is desired to be developed between a first knotZ_(a) and a second knot Z_(a+1), for the curve Z_(a), Z_(a+1), shown asnumeral 21, in FIG. 1c, then the inventive principles may be used togenerate a series of signals representing the display coordinates forthe nodes along the locus of the smooth continuous curve 21 as followsand similarly for the curves between others of respective pairs ofknots. The data encoding of the knots representing each of the closedoutline loops may also be thought of as a loop, or closed data loop,indicative of and representing the physical arrangement of the knots inthe closed outline loop about the character or symbol outline. Asstated, the outline loop and the data loop therefore, may be thought ofas an order of knots in the loop path and related to a predeterminedloop direction for such order (clockwise or counter-clockwise, forexample). Within that progression, and for the respective outline loopdirection, it can be easily seen that each knot (i.e. Z_(a)) representsan exit point for the curve segment of the outline loop in the knotorder shown by the direction of arrow 20, from a preceding loop knot(i.e. Z_(a-1)) and at the same time, the entrance point for the curvesegment from that knot (i.e. Z_(a)) to a successive knot (i.e. Z_(a+1)).The nodes, generated as explained below are given an order in theoutline loop related to the order of knots on the outline loop and theencoding for the nodes is similarly arranged on the data loop in theorder of the knots.

In explaining the invention, the convention used for identifying a curvepart of the outline loop between knots is to refer to it by its knot endpoints, (i.e. curve part 21 is curve Z_(a), Z_(a+1)). Similarly, aconvention is used to identify a curve entrance and exit angle asexplained below.

The entrance angle a for curve Z_(a), Z_(a+1) (between knots Z_(a) andZ_(a+1)), according to our convention, would be the angle represented bythe first derivative of the curve Z_(a), Z_(a+1) at knot Z_(a) and theexit angle g would be the angle represented by the first derivative ofthe curve segment at the next successive knot Z_(a+1).

As would be understood, where a smooth continuous curve is desired topass through a knot, (i.e. Za) then the entrance angle a, at a knotwould be the same as the exit angle g at that same knot for thepreceding curve segment Z_(a-1), Z_(a).

In explaining the principles of the invention, the entrance angles a andexit angles g for curve segments starting and ending at knots aredefined for the respective knots according to the following convention.The curve segments may be thought of as having an entrance angle a atthe knot where the outline loop, in the defined progressive order ofknots, enters a respective curve segment (i.e. curve Z_(a), Z_(a+1))forming an entrance angle a_(a) at that entering knot, and an exit angleg at the next successive knot in the loop where the loop exits curvesegment Z_(a), Z_(a+1) forming exit angle g_(a) at knot Z_(a+1). In theconvention chosen, the entrance and exit angles (a_(a), g_(a)) for acurve segment (Z_(a), Z_(a+1)) of the loop are referenced to theentrance knot (Z_(a)). The entrance angle, a_(a), and the exit angle,g_(a), therefore have a subscript reference to the entrance knot Z_(a),but refer to the curve segment of the loop and the angle that curvesegment makes at a first knot Za where the loop enters the curve Z_(a),Z_(a+1) and the angle at a successive knot (Z_(a+1)) relative to theoutline loop direction where it exits the curve Z_(a), Z_(a+1). Theentrance angle, a_(a), is then the angle the loop makes as it passesthrough knot Z_(a), enters curve Z_(a), Z_(a+1), and continues on toknot Z_(a+1). The exit angle, g_(a), is the angle the loop makes as itpasses through knot Z_(a+1), exits curve Z_(a), Z_(a+1), enters the nextsuccessive curve Z_(a+1), Z_(a+2) and continues on to the nextsubsequent exit knot, Z_(a+2). In summary, the entrance angle, a, andexit angle, g, according to the convention chosen to explain theprinciples of this invention, refer to a curve segment of a loop outlinebetween two knots such as Z_(a) and Z_(a+1), the entrance angle a_(a)being the tangent angle or first derivative the outline loop makes as itenters curve Z_(a), Z_(a+1) at preceding knot end point Z_(a) in theoutline loop direction, and the exit angle, g.sub. a, the tangent orfirst derivative of the outline loop it makes as it exits that curveZ_(a), Z_(a+1) at knot end point Z_(a+1) and enters the next successivecurve Z_(a+1) Z_(a+2), in the outline loop direction. As can be seen,the exit angle, g_(a), for the curve Z_(a), Z_(a+1) is the same angle asthe entrance angle a_(a+1), for the next successive curve Z_(a+1),Z_(a+2), in the outline loop direction. Similarly, the entrance angle,a_(a) is the exit angle, g_(a-1) for the preceeding curve Z_(a-1),Z_(a). It will be understood by those skilled in the art that theseconventions can be changed without changing the principles of theinvention.

Whereas Knuth uses the rule that a smooth continuous curve locus betweenpoints, such as from Z_(a-1) to Z_(a) to Z_(a+1), must take thedirection of a circle, the invention herein avoids that rule and theproblems created thereby by using an average of the interknot angles (B)relative to a knot to define the respective knot entrance and exitangles, a and g respectively, and thereby θ and φ respectively.

For example, in FIG. 1c, for the curve Z_(a), Z_(a+1), shown as numeral21, the entrance angle a_(a) at knot Za of the curve Z_(a), Z_(a+1), forexample, is related to the average of the interknot angles B_(a-1) (fromthe preceeding knot Z_(a-1) to knot Z_(a)) and B_(a) (from Z_(a) to thesucceeding knot Z_(a+1)). That average angle of the outline loop at anyknot Z is also expressed as a when referring to the entrance angle at aknot and into a curve segment and g when referring to the exit anglefrom a knot and out of a curve segment. In the case of knot Z_(a), theaverage entrance angle would be a_(a) for the curve Z_(a), Z_(a+1)(shown by numeral 21), proceeding from Z_(a) to Z_(a+1) in the ordershown by arrow 20 and g_(a-1) for the average exit angle for the curveZ_(a-1), Z_(a) (shown by numeral 23), proceeding from Z_(a-1) to Z_(a)in the order shown by arrow 20.

The angles a or g are always referred to as entrance and exit anglesrespectively herein, but may or may not be average angles or notdepending on the application of each, as explained herein.

The invention is explained with reference to the example of curve Z_(a),Z_(a+1), wherein Z_(a) is the entrance knot and Z_(a+1) is the exitknot, it being understood that the same analysis would apply to othercurve segments either adjoining or further remote from curve Z_(a),Z_(a+1) and having respective entrance and exit knots.

In using the compiler to generate the nodes along a smooth continuouscurve, the encoded data loop representing the knots along the closedoutline loop may be entered at any set of data representing any knot Z,for example, designated to be the entrance knot and the average angledetermined by proceeding in the chosen loop direction using theinterangular relationships of a knot to its related knots in the loop,to determine the average angles a and g at such related knots. In thepreferred embodiment, these related knots are adjacent knots to the nextsuccessive knot to the entrance knot.

In the preferred embodiment, the inventive principles of generating thenodes on the smooth continuous curve locus, starts with a first averageangle, determined for the knot coordinate successive to the data loopentrance knot, and which is represented by the data residing at thelocation in the closed data loop where that data loop was entered. Theinterknot angle for the entrance knot is then saved and used at thecompletion of the loop analysis to determine the average entrance andexit angles at that entrance knot when the outline loop analysis reachesthat entrance knot in the closed outline loop knot. Where the data loopentrance knot is Z_(a-1), its average angle would be determined usingthe preceding interknot angles B_(a-2) and B_(a-1) for related knotsZ_(a-1) and Z_(a-2).

Following the above, the average angle a_(a) and exit angle g_(a-1) atknot Z_(a) is the average of B_(a-1) and B_(a) and expressed as ##EQU2##

The average exit angle g_(a) and entrance angle a_(a+1) at knot Z_(a+1)is the average of B_(a) and B_(a+1) and expressed as ##EQU3##

As shown, the average entrance angle a for any curve segment is theaverage of the interknot angles at the respective curve segment knot andat related knots, (i.e. the preceding knot in the outline loop) and theaverage exit angle g is the average of the interknot angles at therespective curve segment exit knot and at related knots (i.e. the nextsuccessive knot in the outline loop), as shown above.

The parametric cubic polynomial compiler may then be employed to relatethe entrance and exit angles a, g for the respective entrance and exitknots to a series of nodes describing the locus of a smooth curvebetween the respective entrance and exit knots (i.e. Z_(a), Z_(a+1)).For the example above, the knots are Z_(a), Z_(a+1) and the respectiveentrance and exit angles are a_(a) and g_(a) for curve Z_(a), Z_(a+1).

The curve velocities r and s are related to the deviance angles θ and φ,as set forth above and as used in equation 4.1, 4.2, 4.3. As stated inthe foregoing, θ is the deviance between the average entrance angle, forexample, a_(a) for curve Z_(a), Z_(a+1), at an entrance knot Z_(a) andthe interknot angle B_(a) at that entrance knot Z_(a). Similarly, φ isthe deviance between the average exit angle, for example, at the exitknot, Z_(a+1), for the curve Z_(a), Z_(a+1) and the interknot angleB_(a) at that entrance knot Za.

The relationships between a_(a), B_(a), g_(a), θ_(a) and φ_(a) may bemore clearly seen in FIGS. 1d and 1e for knots Z_(a) and Z_(a+1)respectively.

As a remainder, it should be remembered that the angles, θ and φ are thetangents to the locus of the curve represented by the nodes generatedusing the cubic parametric polynomial compiler with respect to therespective interknot angles.

The coordinate values of Z_(a), Z_(a+1), used through the parametriccubic polynomial compiler to generate the node values are the scaledintercept values given in RRU's, derived from the master encoded valuesof the knots, in DRUs. For example, assuming an encoding grid shown asan M² in FIG. 3 and defined as 864×864 DRU's between master encodinggrid (x,y) coordinates 592, 736; 592, 1600; 1456, 1600 and 1456, 448(wherein x,y points 592, 736 are defined as relative 0,0, relative to anx, y offset of 592, 736 respectively) and wherein the encoding grid isdefined as 2047 by 2047 DRU's.

In the preferred embodiment, the universe of the master encoding gridcomprising the M² is 32,768×32,768 DRU's and the offset which positionsthe origin of the M² can be positioned anywhere in that universe. In thepreferred embodiment, the x and y offsets and shown in FIG. 3.

The x,y coordinates of the intercept locations for knots Z_(a) at thedisplayed size in RRU's may be derived prior to generating the nodes byscaling, using the following conversion factor (CF), for the preferredembodiment. Where:

"P" in the desired display size in points per M² (Pt/M²),

"Res" is the ratio of micrometers per point (uM/Pt) and serves toconvert the display size from points to metric units;

"RRU/MM" is the display resolution in Raster Resolution Units perMicrometer;

M² /DRU is the inverse of the encoding grid resolution, in DRUs per M² ;and

    (P)*(Res)*(RRU/MM)*(M.sup.2 /DRU)=(CF)*(RRU/DRU)

For Master Coordinate Z_(n) (X_(n), Y_(n)),

    (X.sub.n DRUs)(CF.sub.x RRUs/DRU)=X.sub.n RRUs,

and

    (Y.sub.n DRUs)(CF.sub.y RRUs/DRU)=Y.sub.n RRUs

The value of the parameter t may be derived from the respective curvesegment interknot distance Z_(d) =|Z_(n+1) -Z_(n) | given after scalingin RRUs, as described below. The generated coordinates for the nodes areexpressed in RRU's permitting run length encoding of the display outlinecoordinates. Where Z_(d) is a non-integer, the fractional value may bediscarded or rounded with redundant values eliminated.

In the preferred embodiment of this invention, the incremental value oft is related to the inverted value of the absolute difference Z_(d)between the entrance and the exit knots, i.e.

    t.sub.-- inc=1/Z.sub.d =1/|Z.sub.n+1 -Z.sub.n |.

Zn may be easily derived from the axial difference in the X direction,i.e. Z_(d) =[(X_(n+1) -X_(n))/Cosine (B_(n))], or the axial differencein the Y direction, [Z_(d) =[(Y_(n+1) -Y_(n))/Sine (B_(n))]; Where X_(n)Y_(n+1) ; X_(n+1), Y_(n+1) are successive knots defining end points fora curve segment of the closed outline loop and Bn is the interknot anglethere between).

In practice, it is better to use the larger axial value in the X or Ydirection, to minimize error. In implementing the invention, thepreferred embodiment limits increments of t to 1/1024. Discrete valuesof T₁ =3t² -2t³, T₂ =t² (1-t) and T₃ =t(1-t)² (see equation 3.1, 3.2)may be stored in a look-up table for 1024 values of t in the range1/1024 t 1024/1024.

In practice t is stored in the range of 1023/1024 because the knot endpoint coordinate corresponding to t=1024/1024 or 1 is saved, avoidingthe need to calculate that knot end point and providing a more reliableresult.

Further, because of the relationship of T₁, T₂ and T₃, a look-up tableas shown in FIg. 4, having values of T₂ starting with t=0 and endingwith a value of T₂ for t=1, may be accessed in reverse order for valuesof T₃, as shown in FIG. 4.

The values, shown stored in a look-up table in FIG. 4, are for discretevalues of t in discrete steps of 1/1024 (i.e. 0/1024 to 1023/1024).However, t is shown being inclusive from 0 to 1 for the purpose ofexplanation, it being understood that in the preferred embodiment,varies between 0 and 1023/1024 as the end point for T₂ 1024/1024 isknown.

Because the functions domain of the variable t for the solution sets T₂=t(1-t)² and T₃ =t² (1-t) overlap, a table of values may be accessed inone data direction with respect to a first domain of variables for whichthe value represents a solution set. Similarly, that solution set may beaccessed in an opposite data direction for a second domain of avariable.

Also, because the function |1+Cos Ψ| Sin Ψ is symmetric about 45degrees, it is only necessary to store values thereof for 0 to 45degrees in half angle steps.

The solution set of values for the functions T₂ and T₃ may be accessedin a first data direction to provide the functional solution set valuesfor the domain t=0 to t=1 and in reverse order for the domain t=1 tot=0. Values of Sine may be stored in half angle steps between 0 and 90degrees. Further, any derived nodes may be stored and used again wherethe respective curve or corresponding symbol outline loop is to beduplicated.

By forming a cumulative value of t as a multiple of the incrementalvalue of t and applying cumulative discrete selected values of t withinthe parametric cubic polynomial compiler, according to equation 3.1,display intercepts represented by the generated nodes are produced whichmay then be used as the display coordinates for the closed loop outlineat the desired display size.

As stated above, the value of θ and φ used in the compiler are derived,according to the principles of the invention from the average entranceand exit angles, a and g at a respective set of entrance and exit knots.The nodes which are generated using the incremental value of t toincrement the cumulative value of t and by applying discrete selectedcumulative incremented t values to the cubic parametric polynomialcompiler to produce respective node coordinates for such discreteselected values of t.

The nodes, represent locations on the curve, which, as stated above,form an angle at the entrance knot of the curve as given by θ, and formsan angle at the exit knot given by φ. As stated, an order is chosen forthe knots and the order of knots defines an outline loop of knots, thenodes being locations on the curve, between the knots also have an orderdefined by that knot order and by the defined outline loop. As would beunderstood by those skilled in the art, that order is the succession ofknots and nodes encountered as one progresses along the outline loop asspecified. The data for the knots and nodes, as stated above, is encodedin a data loop in that same order of knots and nodes. The encoded knotsand nodes are placed in the data loop, in that order corresponding tothe outline loop. Then, as one progresses in the defined order along thedata loop, corresponding to the outline loop, one would encounter theencoding for the knots and nodes in the data loop in an order,corresponding to the order one would encounter the respective knots andnodes on the outline loop represented by that said encoding.

In summary, given the knot locations, and the angles of the curve at anentrance and exit knot as defined above, and given an incremental valueof t, then each discrete selected cumulative value of t, as describedabove, applied to the cubic polynomial parametric compiler would producerespective nodes, indicative of locations along the smooth continuouscurve described by the cubic parametric polynomial. The encoding for theknots and nodes would be in the same order along a data loop as onewould encounter the corresponding knots and nodes along the outlineloop, when proceeding in a chosen order along the outline loop.

The outline loop, when closing upon itself as shown in FIG. 1b, forexample, is called a closed outline loop. The data when encoded in adata loop which closes upon itself corresponding to the closed outlineloop is called a closed data loop. In this way, accessing the closeddata loop, in a direction corresponding to the chosen direction alongthe closed outline loop will return one to the initial or starting dataloop entrance location. As described below, the data loop decoding isnot complete until a determination is made that the accessed locationfor the closed data loop is starting location point and that accessingof all the encoded data in the closed data loop has been completed.

Of course, as one skilled in the art would realize, variations of theabove closed outline loop and closed data loop can be made withoutdeparting from the principles of the invention.

These node coordinate values given in Raster Units may then be used inrun length or other suitable data forms to modulate a display to producethe curve at the desired size, as is well known.

The compiler according to the foregoing is shown below.

ENCODING

The novel manner of encoding the data pack, according to the principlesof the invention, is shown in the Table I below, wherein p is the valueof dx, q is the value of dy and 0, 1, 2, . . . D, E, F, are bitpositions in the encoded data pack. In the preferred embodiment, the bitpositions are valued according to the binary number system. The ControlCodes, explained below, are shown in Table II. The encoding, shown for amaximum 12 binary words of 3 nibbles, in the preferred embodiment, isused to define a control code or coordinate position for the masterencoding grid. It should be understood that the size of the word and thenumber of nibbles used, as described below would increase to accommodatea larger universe, commensurate with a larger size master encoding grid.

The binary words are encoded in a series of nibble length data words,arranged in the order of the data loop. In this way, as will be shownbelow, the values of selected data words with a nibble series may beused to define the number of nibbles in a complete information set andthe initial nibble or bit positions in the next successive completeinformation set.

A complete information set (CIS) would be the set of data wordsnecessary to completely define the next coordinate or a control code, asshown below.

                                      TABLE I                                     __________________________________________________________________________    Case Indi-                                                                    cated by a                                                                    1st nibble                                                                    value of                                                                            F E D C B A 9 8 7 6 5 4 3 2 1 0 Case                                                                             Limits                               __________________________________________________________________________    1-3                           0 0 q1                                                                              q0                                                                              .I.a                                                                             p = 0   q = [1 . . . 3]              0                     q3                                                                              q2                                                                              q1                                                                              q0                                                                              0 0 0 0 .I.b                                                                             p = 0    q = [0,4 . . . 18]          4-7                   q2                                                                              p2                                                                              p1                                                                              p0                                                                              0 1 q1                                                                              q0                                                                              .II.                                                                             p = [1 . . . 8]                                                               q = [1 . . . 8]                       8-B          q3                                                                              q2                                                                              q1                                                                              q0                                                                              p3                                                                              p2                                                                              p1                                                                              p0                                                                              1 0 q4                                                                              p4                                                                              .III.                                                                            p = [1 . . . 32]                                                              q = [1 . . . 32]                     C-F   p6                                                                              q6                                                                              q5                                                                              q4                                                                              q3                                                                              q2                                                                              q1                                                                              q0                                                                              p3                                                                              p2                                                                              p1                                                                              p0                                                                              1 1 p5                                                                              p4                                                                              .IV.                                                                             p = [1 . . . 128]                                                             q = [1 . . . 128]                    __________________________________________________________________________

                                      TABLE II                                    __________________________________________________________________________              Override                                                                      Control                                                                              Total No. of Data Words                                      Case                                                                             Definition                                                                           Code Value                                                                           Needed incl. 1st Data Word                                                                  Purpose                                        __________________________________________________________________________    Ib end last                                                                             0      2             end of last loop                               Ia horizontal(x)                                                                        1      1 + 3 = 4     horizontal motion                              Ia vertical(y)                                                                          2      1 + 3 = 4     vertical motion                                Ia diagonal(x,y)                                                                        3      1 + 3 + 3 = 7 diagonal motion                                Ic start loop                                                                           4      2             end/start new loop                             Ib x negate                                                                             5      2             invert x direction                             Ib y negate                                                                             6      2             invert y direction                             Ib xy negate                                                                            7      2             invert x & y direction                         Ib line sharp                                                                           8      2             linear interpolate sharp knot                  Ib line smooth                                                                          9      2             linear interpolate smooth knot                 Ib sharp  10     2             curve interpolate sharp knot                   Ib smooth 11     2             curve interpolate smooth                       __________________________________________________________________________                                   knot                                       

The data pack forming the closed data loop is used for encoding theaxial distances in DRUs (p=dx, q=dy) between knots, and for the doublepurpose of identifying and accessing override control codes. Theseoverride control codes are used to speed the decoding process and reducethe requirement for encoded data describing coordinate points whileoffering the further option of edit commands.

The data pack override control codes may be used to override machinedefault command codes which would otherwise be responsive to parametersexpressed within the data pack. As can be seen, the data pack offers theoption of following default command codes, responsive to predeterminedparameters, such as angles between knots or interknot distances, oroverride control codes for generating the desired series of nodes andcurve locus between knots.

In the preferred embodiment, the default command codes are selectedresponsive to the parameters of the closed outline loop described by theinterknot distances expressed within the data pack. The process of theinvention described above for generating a series of nodes forming asmooth continuous curve between a set of end points would normally beused except where the distance between those end points was greater thana predetermined distance, such as 128 units for the preferredembodiment. In that case, where the interknot coordinate distances weregreater than 128 units, the default command code responsive theretowould direct straight line interpolation and the formation of a seriesof nodes to find the locus of that straight line between the knotsdefining that respective coordinate distance.

Similarly, where the exterior angle formed by a line from the entranceknot to the exit knot and by a line formed from the exit knot to asuccessive knot is greater than a predetermined angle, such as 40° inthe preferred embodiment, then a default command code responsive theretowould direct that a cusp be formed at the exit knot.

Straight line interpolation is well-known in the art. However, withinthe inventive scheme herein is provided an auto-scaling interpolationwhich provides an innovative and simpler method of linear interpolationand at the same time increases its accuracy and the precision of theclosed outline loop as defined by the series of generated nodes. Theauto-scaling linear interpolator is described below.

The format of the data pack shown in Table 1 is based 4 bit boundriesdefining data words of 4 bits each. Data from the data pack,representing discrete complete information sets is accessed in a seriesof data words in nibbles of 4 bits at a time with the significance ofthat complete information set (CIS) and the number of data words thereinindicated by the value of the first nibble. The correspondence betweenthe first data word value of a series of data words forming a CIS andthe Case indicated by that first data word value is shown below.

    ______________________________________                                        First data word value                                                                          Case     Purpose                                             ______________________________________                                        1-3              Ia       Control Code                                        0                Ib       Control Code                                        4-7              II       Coordinate Distance                                  8-B             III      Coordinate Distance                                 C-F              IV       Coordinate Distance                                 ______________________________________                                    

A series of data words may be a control code as in the Cases Ia and Ibor the coordinate distances between knots, represented by the x,yincremental values between such knots in the preferred embodiment, inCases II, III and IV.

Where the data words are nibbles, in the preferred embodiment the firstnibble value of a nibble series then indicates the Case, and directs theaccess of a predetermined number of successive nibbles or data wordswithin the closed data loop from the CIS and to complete the overridecontrol code, as in Case Ia or Ib or to assemble the number of datawords necessary to complete the values corresponding to the coordinatedistance between the next knot in the closed outline loop, as in CasesII, III and IV.

The number of nibbles or data words accessed responsive to the firstnibble or data word value are the nibble or data word series necessaryto form the CIS for the particular Case, after the first nibble or dataword, as follows:

In Case II, one nibble or a total of 2 nibbles are required. In CaseIII, two more nibbles after the first nibble, or a total of 3 nibblesare required, and in Case IV, three more nibbles after the first nibble,or a total of 4 nibbles are required to provide the value of theinterknot coordinate distance.

In the Cases Ia and Ib, the number of successive nibbles which must beaccessed, responsive to the value of the first nibble, is orderedresponsively to the Case indicated and as explained in detail below. Forexample, Case I may require the accessing of 3 or 6 nibbles to completethe Case Ia control code.

At the end of the data word series of a CIS, accessed responsive to thefirst data word value, the next successive nibble in the closed dataloop would then be considered the first data word value of the next dataword series and corresponding CIS. That new first data word value of thenext data word series would then in a similar manner indicate the numberof successive data words to be accessed to complete the completedinformation set for the override control code or the value of theinterknot coordinate distance, as the case may be. By encoding theclosed data loop on 4 bit boundries, the data with respect to controlcodes may be packed successively within the closed data loop with thedata respecting the interknot coordinate distances and, as such, theclosed data loop may serve the double function of providing overridecontrol codes as well as interknot distance data.

Table II provides a definition of the control codes, control code value,the number of nibbles including the first nibble to complete the controlcode instruction and the purpose of the control code.

Further, as shown in Table I, and as stated above, a first nibble valueof 1 to 3 is indicative of Case Ia and with that first nibble valueindicating the particular control code value for case Ia, either 1, 2,or 3, and the number of subsequent nibbles to be accessed for the CISforming that particular Case Ia control code.

As shown in Table II, 3 additional nibbles are required for a total of 4nibbles, including the first nibble, to complete the CIS responsible toa control code value 1, 3 additional nibbles for a total of 4 nibblesare needed to complete the CIS responsive to a control code value of 2and 6 additional nibbles for a total of 7 nibbles are needed to completethe CIS responsive to a control code value of 3.

Where the first nibble value of a CIS is zero, then Case Ib isindicated, as shown in the Table I, and the access of the nextsuccessive nibble directed for completion of the Case Ib instruction. InCase Ib, 4 is added to that next nibble value to obtain the control codevalue for case Ib. The control code values for Case Ib are shown intable II with their corresponding purposes.

In summary, a first nibble value of 0, or 1 to 3, indicates Case Ia orCase Ib as shown above, and directs the accessing of a predeterminednumber of nibbles in the closed data loop successive to the firstnibble, to form the CIS for that Case and which is then used todetermine the control code value which in turn directs the processor.The next nibble subsequent in the order of the closed data loop to thelast nibble of the previous nibble series corresponding to a CIS thenbecomes a new first nibble value and is used to indicate either anoverride control code or interknot coordinate distance. Further, and asshown below, where the first nibble bit as shown above indicates a CaseII, the ordering of one more nibble for a total of 2 nibbles is requiredto complete the CIS and to provide the incremental coordinate distance.For Case III, 2 more nibbles for a total of 3 nibbles are required tocomplete the CIS for the incremental coordinate distance. For Case IV, 3more nibbles for a total of 4 nibbles are required to complete the CISfor the incremental coordinate distance for code 4. Then the nextsuccessive nibble in the closed data loop after the CIS would be the newfirst nibble value indicative of case Ia, Ib, II, III, or IV, as thecase may be, leading to an indication of the number of successivenibbles needed to complete the CIS to complete the control code orincremental coordinate distance.

For the override control code Case Ia, where the next successive knot inthe closed outline loop is to be defined by Case Ia, control code values1, 2 or 3, as shown in Table II, then, the first nibble value will havea value of 1, 2 or 3 (thereby indicating override control code Case Ia),and with the control code value being indiated by the specified firstnibble value (i.e. 1, 2, or 3). The number of successive nibbles to beaccessed to form the CIS for that Case Ia control code are indicated bythe value of the first nibble value. Where the value of that firstnibble value is 1, then as shown in Table II, the next three nibbles inthe closed data loop are accessed and used to denote horizontal ormotion in the X direction with the next knot X coordinate given by thenext three nibbles, completing the nibble series necessary to form theCompleted Information Set for that control code.

Where the value of that 1st nibble is 2, then as shown in table II, avertical motion in the Y direction is indicated with the next threenibbles in the closed data loop being accessed, to complete the nibbleseries necessary to form the CIS and indicating the Y coordinate valueof the next knot.

Where the value of that 1st nibble is 3, then the next six nibbles inthe closed data loop are accessed to complete the nibble series andnecessary to form the CIS and indicating the next knot, diagonallyrelated to the immediate knot, and with the X,Y coordinates thereforegiven in each of the next 3 nibbles.

In the preferred embodiment, the least significant bit of the controlcodes for Case Ia, namely control codes 1, 2, and 3 is used to provide adirection instruction for new X, Y or X,Y coordinate values relative tothe preceding knot in the closed outline loop. That relative directionbetween the new knot position and the preceding knot is then followedwhen locating the positions of successive knots corresponding to theinformation in a Case II, III or III instruction indicating theincremental coordinate distance. As will be seen below, the directionmay also be changed by a Case Ib control code 5, 6 or 7 which wouldnegate the established X, Y or XY direction.

In summary, in the closed outline loop new knot coordinates as indicatedby Case Ia, control code values 1, 2 or 3, shown in table II, would belocated in a direction consistent with a previous X and Y directioninstruction, unless the least significant bit of the first nibble valuefor the CIS indicates a change in direction, as in Case Ib, control codevalues 5, 6 and 7.

In summary, the first data word value is the value of the first dataword of a series of data words forming the Completed Information Set(CIS) of the closed data loop, indicating a override control, code as incase Ia, for first nibble values 1, 2 and 3, or as in Case Ib, for value0, or the incremental coordinate distances as for first nibble values4-F, for cases II, III or IV.

Then, as stated above, if the 1st data word value, in a nibble size dataword series is a zero, then control code case Ib is denoted. Case Ib,directs the access of another nibble of 4 bits in the closed data loopand, if that nibble is not equal to 0, its value is added to value 3 toobtain the proper control code, as shown in Table II. In this way, atotal value of control codes 0 and 4 to 18 may be defined. The meaningsof each of the control codes having values 4-11 is shown in Table II.

If the control code value for the additional 4 bits is zero, the end ofthe last loop is indicated (i.e. bits 4-7 are 0 value).

Code 4 indicates the start of a loop.

Codes 5, 6 and 7 provide direction information for the next knot in theclosed outline loop relative to the preceding knot.

Codes 8, 9, 10 and 11 are editing override control codes, which overridethe default command codes.

The editing override control codes are used to override the defaultcommand codes, which would normally be responsive to and result from amachine interpretation of the data pack values for cases II, III and IV.

Code 8 directs Linear Interpolation Sharp Knot. As shown in FIG. 5, itmay be used to force the exit angle at a knot (i.e. g_(a) at knotZ_(a+1)) for curve Z_(a), Z_(a+1), to be equal to the interknot angleB_(a) at the entrance knot, Z_(a) of that same curve Z_(a), Z_(a+1). Asshown in FIG. 5, Code 8 forces the curve Z_(a), Z_(a+1), at knot Z_(a+1)to have the same exit angle at the exit knot (Z_(a+1)) as the interknotangle B_(a) at its entrance knot Z_(a) and produces a sharp cusp atZ_(a+1). To complete the cusp at Z_(a+1), the entrance angle a_(a+1) forcurve Z_(a+1), Z_(a+2) would be forced equal to the interknot angleB_(a+1) at Z_(a+1).

Code 9 denotes Linear Interpolation-Smooth Knot and may be used, forexample, to force a smooth knot located at the end of a curve Z_(a),Z_(a+1) which then becomes a straight line, or at the end of a straightline, which then becomes a smooth continuous curve.

The use of override control code 9 is shown in FIG. 6a where a knotjoins a straight line curve Z_(a), Z_(a+1) to a smooth continuous curve,Z_(a+1), Z_(a+2). In this case, a_(a+1) is set equal to B_(a).

Where a knot joins a curve section Z_(a), Z_(a+1) to a straight linecurve, Z_(a+1), Z_(a+2), as shown in FIG. 6b, then g_(a), the exit anglefor curve Z_(a), Z_(a+1) is made equal to B_(a+1), the interknot anglebetween Z_(a+1), Z_(a+2).

It should be understood, however, that if a knot joins two straightlines, this rule shown with respect to FIG. 5 is used in the preferredembodiment.

Control code 10 directs a curve interpolation at a sharp knot and isused to form a cusp at the entrance knot or the exit knot of a smoothcontinuous curve segment joined by that knot to a straight line. Shownin FIG. 7a, are two examples, i.e. the curve Z_(a), Z_(a+1) is formedwith a sharp knot at the entrance knot Z_(a) and the curve Z_(a+1),Z_(a+2) is formed with a sharp knot at the exit knot Z_(a+2). Thiscontrol code is useful in overriding a default command code which wouldotherwise require that the sharp knot at Z_(a), for example have anentrance angle for curve Z_(a), Z_(a+1) equal to B_(a) which wouldintroduce a distortion in curve Z_(a), Z_(a+1) at area 31, approximatethe entrance knot Z_(a) for curve Z_(a), Z_(a+1), as shown in FIG. 7b.Similarly, a distortion would be introduced in a smooth continuous curveterminating in a sharp knot. For example, in curve Z_(a+1), Z_(a+2) asshown by numeral 33 in FIG. 7b, approximate the exit knot Z_(a+2), whereg_(a+1) would be forced to equal B_(a+1) to form a cusp. code 10overrides the default command code and forces θ (i.e. θ_(a)) to be equalto φ (i.e. φ_(a)).

Where a cusp is to be formed at knot Z_(a), the default command codewould specify that the exit angle, g_(a) at knot Z_(a) would be equal tothe interknot angle B_(a-1) at the preceding knot Z_(a-1), for curveZ_(a-1), Z_(a), and the entrance angle a_(a) for curve Z_(a), Z_(a+1)would be equal to the interknot angle B_(a) between the entrance knotZ_(a) for curve Z_(a), Z_(a+1) and its exit knot Z_(a+1). As statedabove, this would produce the result shown in FIG. 7b, and a distortionof the smooth continuous curve Z_(a), Z_(a+1) shown in FIG. 7a. With theresult of FIG. 7b, the deviance angle θ_(a) between B_(a) and a_(a)would be zero as stated above. In this case, to avoid the distortionshown by numerals 31, 33 in FIG. 7b and to produce the smooth continuouscurve as shown in FIG. 7a, θ_(a) is forced equal to φ_(a) the devianceangle, at exit knot Z_(a+1), as stated above. In the case shown in FIG.7a, arranged, for the sake, of explanation g_(a) is equal to zero, φ_(a)is equal to B_(a).

A similar result is forced by using a code 10 to control the shape ofcurve Z_(a+1), Z_(a+2) at exit knot Z_(a+2). As stated above, thedefault command code responsive to a cusp at Z_(a+2) for example, woulddirect the curve Z_(a+1), Z_(a+2), to the shape shown in FIG. 7b andparticularly shown by numeral 33 approximate Z_(a+2) by directing thatthe exit angle g_(a+1) at knot Z_(a+2) is equal to the interknot angleB_(a+1) at the entrance knot Z_(a+1) for that same curve. However, byusing code 11 to direct that φ_(a+1) is equal to θ_(a+1), then at exitknot Z_(a+2) for curve Z_(a+1), Z_(a+2) g_(a+1) is equal to 2*B_(a+1)(g_(a) =0, a_(a+1) =0, θ_(a+1) =a_(a+1) -B_(a-1)).

For the sake of explanation, a_(a+1) is equal to 0, for curve Z_(a+1),Z_(a+2).

The effect of code 10 is to produce a smooth continuous curve from or toa cusp such as at entrance knot Z_(a) or at exit knot Z_(a+2) andsymmetrical about the respective curve midpoints, as shown by numeral 35and numeral 37, respectively for curve Z_(a), Z_(a+1) and for curveZ_(a+1), Z_(a+2).

Control code 10 is to override a default command code which wouldotherwise specify a cusp, such as where the exterior angle as describedabove was above a threshold such as 40° as shown in the preferredembodiment, or the interknot distance was greater than a predetermineddistance, such as 120 units in the preferred embodiment. In this case, asmooth knot would be formed as described above, by taking the average ofthe interknot angles between a preceding knot and the subject knot andthe subject knot and a successive knot in the outline loop direction ofthe closed outline loop. However, as explained above, if the absolutevalue of the interknot angles between the preceding knot and the subjectknot and the subject knot and the successive knot is greater than 180°,then the supplemental average is used by supplementing the average angleby 180°. This is to orient the angle in the correct direction where therelationship of the average angle described above would result in aresultant angle 180° out of phase with its correct direction.

The application of the inventive principles will force the angularrelationships of a g, θ and φ at the respective knots to conform to therules described above, as necessary to produce the desired curve,straight line, cusp, or smooth knot, whether directed by the defaultcommand codes or by the override control codes. It should be noted,however, that where an override control code is used, it is used toforce a result contrary to what would ordinarily be produced using thedefault command codes. For example, if the default command code wouldproduce a cusp and a smooth knot was desired followed by a smoothcontinuous curve or preceded by a smooth continuous curve, then a code10 would be used. If the default command code would have produced asmooth continuous curve, and a straight line joining a sharp knot isdesired, then a code 8 would be selected. If a smooth knot is desiredjoined to a straight line, then a code 9 may be selected to override thedefault command control. All of the foregoing is shown in connectionwith FIGS. 5, 6, 6a, 7, 7a and 8 and in the text accompanying thesefigures.

A typical encoding for an A as shown in FIG. 9 is shown in the appendix.The compiler for decoding the packed encoded information is also shownbelow, and is used with a Motorola 68000 processor. As the desiredoutput is a series of intercepts at the intersection of the locus of thecharacter outline, and the display raster lines, these intercepts can beconverted into modulating information for imaging the character on animaging surface by any suitable well-known imaging device.

For the sake of explanation and in the way of an example, a closed dataloop for the encoded A shown in FIG. 9, is set forth below anddescribed.

    __________________________________________________________________________    CLOSED DATA LOOP FOR THE "A" OF FIG. 9                                        (Given in hexadecimal Notation)                                               __________________________________________________________________________    83 98 3C 82 E8 5E 02 4C 01 5C 02 5E 16 49 00 5B                               30 B2 54 D6 75 96 83 78 81 A7 D7 5A 37 1B 80 7C                               57 3A 83 89 0E 85 E0 28 24 15 C0 20 49 77 96 88                               7D 2F 30 60 62 F1 6D 0F 60 26 AD 28 20 C1 8A 88                               06 50 10 06 95 99 7B 88 58 80 B0 82 08 01 3A 70                               FF FF 00 10 79 06 50 37 31 19 7B 73 53 81 51 79                               __________________________________________________________________________

As stated above, the closed data loop is encoded on data words of 4 bitor nibble boundries and the sequence of the nibbles is as given below.In accordance with the preferred embodiment, the first two bytes 5B ofthe closed data loop indicate the total number of bytes in the data loopfor a closed outline loop. The first two bytes, 00 5b indicates thatthere are 91 bytes total in the data loop for the symbol A, describingoutside closed outline loop 31 in the direction of arrows 31 and insideclosed outline loop 35 in the direction of arrows 35.

In accordance with the preferred embodiment, the starting X and Ycoordinates are given in three nibble packs of information for eachrespective X and Y location. Accordingly, the next three nibbles, 6 49relates to the starting X location. In accordance with the principles ofthe invention and the preferred embodiment, the least significant bit ofthe data for a new X or a new Y location is a sign bit indicative of thedirection. Accordingly, in processing the data in the preferredembodiment, a shift of one binary position is made to remove the signbit, giving a decimal data value of 804. As described above in thepreferred embodiment, since the origin of the M² is offset by 592 units,592 must be subtracted from 804 to provide the correct X coordinate withreference to the origin of the M² of 212. The sign of the X direction,whether positive or negative with regard to the origin of the M² isgiven by the sign bit and is positive if the sign bit is zero, in thepreferred embodiment.

In accordance with the principles of the invention, the starting Yposition given as a new Y position is indicated by the next nibbleseries of 3 nibbles or by 5El, which is divided by 2 to remove the signbit yielding the result of 750. In accordance with the offset of the M²at 736 units, 736 is subtracted from 752 to yield a Y coordinate of 16.The sign bit which is a 1, indicates a negative direction for Y.Accordingly for the "A" of FIG. 9, the start point x, y coordinatesshown as numeral 39, is 212, 16 with the new direction being x,-y.

As stated in the preferred embodiment, the data pack is decoded by usingthe first two bytes to indicate the number of bytes in the closed dataloop corresponding to the coordinate points around the closed outlineloop, and by three nibbles each comprising twelve bits corresponding tothe respective X and Y start locations. It should be noted that whereverthe X coordinates are defined by new coordinate values, the leastsignificant bit is used as a sign bit to indicate the coordinatedirection. The process performs a divide by two which separates that bitto define the aforesaid direction signed. Additionally, the X positionis referenced to the home or reference position in the M² which may beoffset with regard to the origin of the master encoding grid bysubtracting the offset from a coordinate position accordingly. With thisin mind, the following process is described which produces the listingof coordinates shown below and in FIG. 9.

As stated, the start position is at XY coordinates 212, 0. As the lastbit of data accessed from the data pack, to provide complete informationfor the preceding nibble series was the tenth nibble corresponding tohexadecimal number 5. The next nibble which follows a completeinformation series of nibbles is a first nibble value.

As shown, the first nibble value 2 indicates a case Ia and according totable II directs the access of the next three nibbles, 5C0 indicative ofthe new X coordinate position. In accordance with the procedure above, adivision by 2 removes the sign bit and a subtraction process isperformed relative to the M² offset, to reference the new Y position tothe M² home position or at zero. The first nibble value "1", followingthe nibble series for the completed information set of 5C02 thenindicates a case Ia and a new X coordinate. In accordance with theprocess described above, a binary division of two is performed toisolate the sign bit, indicate the direction and a subtraction isperformed to reference the new X position to the home position.Accordingly, the new X position is 16.

The next coordinate position of 16,16 is given by the completeinformation set 2E8, with the nibble series first nibble value 8indicating of a Case III. In accordance with the format of the data packas shown in Table I, P=X is equal to 01110 and Q=y is equal to 00010.This translates to 14 and 2 in decimal rotation respectively. Inaccordance with the preferred embodiment, as it would be redundant touse Cases II, III and IV, for a translation of 0, a 1 is added to theresults of p=x and q=y to provide the new X and Y coordinate distancesof 15 and 3 respectively. The p value is added to previous X value of 16to provide a new X value of 31, and the q value is added to the previousY value of 16 to provide a new Y value of 19 accordingly.

As a reminder, it should be understood, that this process of decodingthe data pack being described is designed to decode the encoded knotcoordinates only. After decoding the inventive principles describedherein are applied to the knots to either produce a series of nodesdescribing a smooth continuous curve between the knots, as between knots16, 16, and knots 31, 19 or a straight line as between knot 212, 0 andknot 16, 0. In accordance with the preferred embodiment, the directionof the knots indicated by the completed information set 2E8 relative tothe previous knot is in accordance with the direction established by thelast previous sign bit accessed for the respective X and Y directions asshown above, or by 567 as described below.

The next nibble following the nibble series for the completedinformation set above has the first nibble value of 8 which is a CaseIII, directing the access of the next two nibbles for providing thenibble series for complete information set of 3C8 corresponding to a p=xvalue of 13 and a q=y value of 4 in accordance with the format shown inTable II. In accordance with the preferred embodiment, the direction ofthe knot denoted by this complete information set follows the lastprevious direction indication given and is accordingly added to theprevious coordinates of 31 and 19 to provide new coordinates of 44 and23.

In accordance with the foregoing, the next nibble being a first nibblevalue is 8 which accordingly directs the access of the next two nibblesto provide a complete information set of 398 producing new coordinatevalues of 54, 27, accordingly.

The next nibble corresponding to a first nibble value of 8, as describedabove, indicates a case 8 and directs the access of the next two nibblesto form the nibble series corresponding to the complete information setof hexadecimal 7C8 and according to the processing described abovedecoding the new coordinates of 67, 35.

As can be seen, the smooth continuous curve between knot end points16,16 and passing through knots 31, 19 and 44, 23 and 54, 27 and, 67, 35are formed according to the principles of the invention to form a smoothcontinuous curve.

The next first nibble value of the next complete information set is zeroindicating Case Ib which directs the access of another nibble to form atwo nibble series complete information set. As the next nibble was 8,for Case Ib, a value of 3 is added thereto forming a value of 11,indicative of control code 11 directing a smooth continuous curve beformed between the last knot having coordinate 67, 35 and the next knotwhich is to be indicated by the next complete information set accessedfrom the closed data loop.

As the first nibble value of the next complete information set is Bindicating Case III, 3 nibbles are accessed forming a 4 nibble seriesdescribing the next complete information set and producing the newcoordinates of 85, 59.

The next first nibble value of the next nibble series for the nextcomplete information set is 3 indicating Case Ia, control code 3, shownin Table II, and which directs the access of a pair of three nibbleseach which are indicative of the next X and Y positions and directionsthereof relative to the previous knot. In accordance with the processdescribed above, the new X and Y position is 349, 606 and as thedistance between this new knot and the previous knot is greater than 128units, the default command code directs linear interpolation. Inaccordance with the above, the hexadecimal value 75A corresponds to thenew X position and A7D corresponds to the new Y position. As statedabove, the least significant bit of each of the above 3 nibblescorresponds to the relative direction of the new X and Y points.

The first nibble value of the next nibble series for the next completeinformation set is 1 indicating a Case Ia and directing the access ofthe next three nibbles of 7A8 to replace the X coordinate with 372 and anew set of coordinates 372, 606.

The next first nibble value for the next nibble series is a 3corresponding to a case Ia, a control code 3 and the access of a pair of3 nibbles, i.e. 968, corresponding to the next X position and 675,corresponding to the new Y positions and new X, Y coordinates of 612, 90respectively.

The next first nibble value following the nibble series for the completeinformation set above is D, corresponding to Case IV which directs theaccess of the next three nibbles to form the 4 nibble series 254, andwhich according to the form shown in Table I provides a p=x value of 20and a q=y value of 37. According to the process described above, a 1 isadded to the p=x value and the q=y value to form decimal coordinatevalues of 21 and 38. Following the most recent X, Y coordinate directioninstructions given, the X incremental value is added to the previouscoordinate 612 providing the new X coordinate of 633 and the Yincremental value is subtracted from the previous Y of 90 to provide anew coordinate value of 52.

The next first nibble value of the next nibble series for the nextcomplete information set is a B corresponding to Case III which directsthe access of two more nibbles to form a three nibble series, completeinformation set, and producing the next coordinate values of 650, 32 forX and Y respectively.

The next first nibble of the next nibble series for the next completeinformation set is 8 corresponding to a Case III, causing the access ofthe next two nibbles to produce a three nibble information set and newcoordinate values of 659, 25 for X and Y respectively.

The next first nibble value is a 9 corresponding to case III anddirecting the access of the next two nibbles of 77 and corresponding tonew X and Y coordinate 683, 17.

The next first nibble value is a 9 causing the access of the next twonibbles 04 and corresponding to the new X, Y coordinates with 704, 16.

The next new first value is 2 corresponding to Case Ia and directing theaccess of the next three nibbles corresponding to the 5C0 correspondingto a new Y value with the direction indicated by the first significantbit therein and producing new XY coordinates at 704, 0 respectively.

The next first nibble value of the next nibble series for the nextcomplete information set is 1 corresponding to a Case Ia and directingthe access of the next two nibbles forming a three nibble seriescomplete information set 824 and corresponding to the new X, Y locationof 450, with respect to the last previous direction given for the axialdirections X and Y.

The next first nibble value 4, the next complete information set is 2corresponding to case Ia and to complete information sets 5E0corresponding to new XY coordinates 450, 16.

The next first nibble value is 8 corresponding to Case III and asdescribed above corresponding to complete information set 0E8 and new XYcoordinates 465, 17.

The next first nibble value is 9 corresponding to Case III and completeinformation set 389 and new XY coordinates 490,21.

The next first nibble value is 8 corresponding to Case III and completeinformation set 38A and new XY coordinates 501,25.

The next first nibble value is 7 corresponding to Case II which directsthe access of another nibble and according to the format shown in TableII provides a p=x value of binary 101 corresponding to a decimal valueof 5 to which one is added in accordance with the procedure above toprovide a decimal value of 6 for the new X coordinate incrementaldistance. Similarly, the q=y value is binary 011 which corresponds to adecimal value of 3, to which one is added in accordance with the processabove to provide a new value of 4 corresponding to the incremental Ycoordinate distance. The new XY coordinates are therefore 507,29accordingly to the directions given in the last previous directioninstruction.

The next first nibble value is 8 corresponding to Case III and the accesof two more nibbles to form the complete information set A88 and XYcoordinates 516, 40.

The next first nibble value is 8 corresponding to Case III, the accessof the next two nibbles form a complete information set C18 and newcoordinates XY of 518, 53.

The next first nibble value is zero corresponding to case Ib whichdirects the access of the next nibble to, which 3 is added in accordancewith procedures described above to form the control code 5. As shown inTable II is an X Negate which changes the X direction from its previousdirection. The next first nibble value is an 8 corresponding to Case IIIand in accordance with the foregoing new X, Y coordinates 515, 67.

The next first nibble value is 8 corresponding to case III and newcoordinates of X, Y of 508, 86, respectively in accordance with theabove procedure.

The next first nibble value is a 0 corresponding to case Ib whichdirects the access of the next nibble 6 to which 3 is added according tothe above procedure to provide a control code of 9. 9 as shown in TableII is a line smooth direction.

The next first nibble value is F corresponding to Case IV and inaccordance with the procedure above causes the access of three morenibbles forming the complete information set 600F and new X, Ycoordinates 459, 196 in accordance with directions as given.

The next first nibble value is 1 corresponding to Case Ia which directsthe access of the next three nibbles, 62F indicative of an X coordinatepoint in accordance with the last previous directions given.Accordingly, the new X, Y coordinates are 199, 196.

The next first nibble value is zero corresponding to Case Ib and directsin the access of the next nibble having a value of 6 to which 3 is addedin accordance with the above procedure to produce a 9 corresponding tocontrol code 9. A next first nibble value is zero once againcorresponding to Case IB which directs the access of a next nibble whichis 3 to which 3 is added giving the control code value 6 which meansnegate Y.

The next first nibble value is F corresponding to Case IV and inaccordance with the above procedure causes the access of the next threenibbles to complete the information set 7D2F and producing a new X, Ycoordinates of 148, 70 which is connected to the previous X, Ycoordinates 199, 66, according to the override control code 9 and in thenew Y direction.

The new first nibble value is zero corresponding to case Ib anddirecting the access of the next nibble having a value of 7 to which 3is added to give it the control code 10.

The next first nibble value is an A corresponding to Case III anddirecting the access of the next two nibbles to give the completeinformation set 13A and the new X and Y coordinates 144, 52respectively.

The next first nibble value is zero corresponding to Case Ib whichdirects the access of another nibble having a value 8 to which 3 isadded in accordance with the above procedure to provide the control code11.

The next first nibble value is zero corresponding to Case Ib directingthe access of another nibble having the value 2 to which 3 is addedgiving the control code 5 which negates the previous X direction.

The next first nibble value is A corresponding to Case III and theaccess of two additional nibbles giving the complete information set B08and the new XY coordinates 145, 40.

The next first nibble value is zero corresponding to case Ib inaccordance with the above procedure control code 11.

The next first nibble value is 8 corresponding to Case III, completeinformation set 858 and new XY coordinates 151, 31.

The next first nibble value is 8 corresponding to Case III, completeinformation set 7B8 and new XY coordinates 163,23.

The next first nibble value is 9 corresponding to Case III, completeinformation set 599 and new XY coordinates 189,17. The next first nibblevalue is 9 corresponding to complete information set 069 and coordinates212, 16.

The above XY coordinates 212,16 bring the traverse of the closed dataloop bringing it back to the starting point.

The next first nibble value is zero indicating Case Ib with the nextaccess nibble I to which 3 is added producing the control code value 4indicating the end of closed data loop.

In accordance with the preferred embodiment, a routine is added, notshown, which would be known to one skilled in the art to ensure that theclosed data loop decoding closes upon the start location of the closeddata loop and completes the closed outline loop by ending at the startpoint encoding of the closed data loop which represents the start of theclosed outline loop.

The second closed outline loop, shown by numeral 35 and arrows 37, ofthe A now starts at the closed data loop coded hexadecimal numbers 790,650 corresponding to new X and Y coordinate values 216, 232 and the Xand Y directions, derived according to the process given above with theregard to the start points for the foregoing loop, 31.

The next first nibble value is 1 corresponding to Case Ia and directingthe access of the next three nibbles 815 and new XY coordinates 442,232.

The next first nibble value is a 3 corresponding to a Case Ia, directingthe access of a pair of three nibbles 735, and 97B corresponding to newX and Y coordinates of 330 and 477 in the negative X and negative Ydirections accordingly.

The next first nibble value is 1 corresponding to Case Ia directing theaccess of the next three nibbles 731 corresponding to X coordinate 328,Y coordinate 477 in the negative X and negative Y directionsaccordingly.

The next first nibble value is 3 corresponding to Case Ia directing theaccess of a pair of three nibbles each corresponding to hexadecimalvalue 690 and 790 and X and Y positions 216, 232, respectively. As 216,232 are the start points, the closed data loop representing the closedoutline loop 35 has been completed and the next first nibble value iszero indicating Case Ib with the last nibble accessed accordingly beingzero indicating the end of loop. Once again, the routine described aboveis used to insure that the closed data loop ends at its start point.

The above is a representative encoding of a letter used in the processto derive the coordinate values around the outline of the character andany override control codes which may be used to replace default commandcodes. However, it should be understood that changes to the codingscould be used consistent with the principles of this invention, asclaimed herein, and that the invention should not be restricted to thecoding or decoding process shown above, with respect to the preferredembodiment.

AUTOSCALING LINEAR INTERPOLATION

Linear interpolation is a well-known technique and is not claimed as aninvention in this application. The autoscaling linear interpolationwhich is claimed and which is described below is a method of increasingthe precision of a machine interpolation procedure which uses as a startpoint, a first set of coordinates and as an ending point a second set ofcoordinates. The coordinates are usually expressed in respectivecoordinate directions such as x and y, for example. In the preferredembodiment, the process of linear interpolation is for the purpose ofproducing coordinate points along a straight line between the first andsecond end points, which coincide with a second coordinate system suchas the intercepts in a raster display. Each of the coordinates are foundby determining the slope of the straight line between the two end pointswhich is equal to the incremental distance in a first coordinatedirection divided by the incremental distance in a second coordinatedirection (i.e. Y₂ -Y₁ /X₂ -X₁). That first coordinate incrementaldistance is expressed in an encoded machine value as a first data word,(i.e. Y₂ -Y₁), in a first machine location. The second coordinateincremental distance between the two end points in the second coordinatedirection (i.e. X₂ -X₁), is also expressed as a machine value and placedin a second machine location. The machine location limits the precisionby which a data word may be expressed. For example, and as iswell-known, each machine is based upon radix, which is a number base.The most common machine number base is the binary number base. Each dataword accordingly, has a number of bit positions with each specified bitposition being a specified power of that radix (i.e. 2⁴, 2³, 2², 2¹, 2⁰,2⁻¹, 2⁻², ). Accordingly, a shift of a data word in a direction of themost significant bits corresponding to higher exponential values ofhigher orders of the machine redix, results in an increase in the scaleor value of the data word. Further, each shift in the direction of themost significant bits, results in an effective multiplication of thedata word value by a scale factor of the machine radix raised to anexponential power corresponding to the number of bits shifted (i.e. 13bit positions shifted is equal to a scale factor of 2¹³ in a binarymachine or equivalent of 8196, in decimal notation. Conversely, eachshift of a data word, towards the least significant bits, correspondingto lower exponential values or orders of that machine radix, correspondsto an effective division by the machine radix value and conversely to areducing scale factor. Further, machine locations for storing data wordsare limited in the number of bits available. As the precision of a dataword is a function of the data space and the number of bits availablefor storing that data word, an increased precision for expressing a dataword are obtainable by extending the number of bits or size of a machinelocation available for specifying a data word. For example, as iswell-recognized, in a decimal system, the number 5.632498 is a moreprecise value than 5.3624 which lacks the last three significant places(i.e. 0.000098), of the former number. In binary, the number 10111.101is a more precise expression than that number truncated or rounded to10111.000, as the latter number is missing the bits 0.101 and istherefore less precise. However, the former binary expression requires alarger machine location for specifying all the relevant bits in thatexpression. The "point" in the above binary and decimal values are usedto indicate the positions, according to the radix system used, toindicate position values equal to or greater than 1 (decimal) and lessthan 1 (decimal) (i.e. integer and fractional values).

The effect of shifting to increase the scale of the Y increment is toeliminate the binary point in a third data word representing the slopeor Y incremental value and thereby avoiding floating point arithmeticoperations. The point separates the bit positions in the radix systemselected, separating fractional from integer values in a data wordhaving values equal to or greater than 1 and less than 1 (i.e. betweenthe bit positions "2⁰ " and "2⁻¹ ". The binary point is equivalent tothe decimal point in a radix 10 system and equivalent to a "point"between those machine positions having a value equal to or greater then1 and less then 1 in any system and as stated, separating the fractionalvalues from the integer values in the slope or Y increment value. Byshifting a machine representation of a number in the direction of moresignificant bits, the scale of the number is increased, thereby movingthe "point" effectively in the direction of the less significant bits.If a sufficient number of bit positions are shifted, the binary point iseliminated from the number. In this way, floating point arithmetic isavoided.

According to the invention, linear interpolation proceeds according tothe known method by determining the coordinate distance in a firstcoordinate direction and in a second coordinate direction between a setof end points. The method is used in the machine having a radix "r"cooresponding to the values of designated bit positions in the encodedwords used within the machine. The process continues by encoding a firstdata word on "N" bits corresponding to the distance between the firstand second end points in the first coordinate (i.e. Y₂ -Y₁), and thenplacing that first data word in a first machine location. To completethe process of calculation the slope, according to the interpolationmethod, a second data word of M bits corresponding to the distancebetween the first and second end points (i.e. X₂ -X₁) in a secondcoorindate direction is encoded and placed in a second location. Themachine is now ready to use the data value in the first location and adata word value in the second location in a process of division toproduce a third data word corresponding to the slope of the straightline between the first and second end points (i.e. Y₂ -Y₁ /Y₂ -X₁). Toincrease the precision or resolution of the third data word according tothe inventive process, the scale of the first data word (i.e. Y₂ -Y₁),is increased by determining the the number of available positionsbetween the most significant position of the first data word and themost significant position of the first machine location. The first dataword is then shifted in a first direction towards the most significantpositions in that first machine location, utilizing those moresignificant positions which were unused, when expressing the first dataword. The scale of the first data word is again increased by shifting asecond time in the same first direction of the most significantpositions by a number of positions corresponding to the number of bitpositions used to encode the second data word (i.e. X₂ -X₁). In thepreferred embodiment, the first machine location is expanded toaccomodate this additional shift. It should be noted that the inventiveprinciple is not limited to the size of available data space in any onemachine or to any machine radix.

In the preferred embodiment, the second shifting operation describedabove occurs in an extension to the first machine location. The quotientcorresponding to the slope (i.e. Y₂ -Y₁ /X₂ -X₁) produced as the thirddata word by division of the first data word by the second data wordwill reduce the first data word to a size coextensive with the firstmachine location. As a result then, the data word may be raised by ascale factor corresponding to a shift in the direction of the mostsignificant positions corresponding to the number of significantpositions used to express the denominator (i.e. X₂ -X₁) or second dataword, as the next division step cancels that said shift of the firstdata value by the said number of bit positions in the second data wordand cooresponding reduces its position length to the size of the firstmachine location.

The third encoded data word (i.e. the Y incremental value for each Xincrement) is then stored and added to the first data word (i.e. Y₁).The second data word (i.e. X₁) is incremented a coordinate word valuecorresponding to the first and second coordinate positions of a pointalong the line are then stored. In Table III are given the coordinate X,Y values; the value of Y incremented at its highest precision and scalefactor for the example shown.

In the iterative process, the third encoded data word at the higherresolution, produced, corresponding to the slope produced according tothe above, is used iteratively as a Y incremental value to derive acumulative Y incremental value related to a respective X coordinatevalue in the first direction (i.e. Y) and stored as a cumulative Y. Asno change has been made to the precision (i.e. the number of positionsused to express the third data word), the precision of the third dataword is the same as the first data word, produced by shifting the firstdata word and increasing its scale, as described.

As interpolation is an iterative process, the data word (i.e. the Yincremental value at the said higher precision), is used to produce thecumulative Y, related to the Y coordinate for a respective X coordinate.

As the purpose of producing data word values corresponding to pointsalong a straight line, is to produce intercepts on a display coordinatesystem, the scale cumulative Y words are reduced to the scale used toexpress the end point coordinate values, by the step of truncating orrounding. Truncating may be accomplished by discarding a predeterminednumber of least significant bits or rounding may be used by a shift inthe direction of the least significant bits, minus one, adding a bitcorresponding to the rounding value such as 0.5 (decimal) and discardingany bits having values less than the least significant bit value ofinterest. In the preferred embodiment, truncating or rounding is to theposition of the lowest integer value in the radix 2 system (i.e. to bitposition 2°).

In the foregoing manner, the scale of cumulative Y is then reduced tofit scale of the data words for the end point coordinates. In thepreferred embodiment, the original precision is that of the coordinateson a display which are the display intercepts, shownn as X, Y in TableIII. The result of using this method is to avoid the incremental errorintroduced into each cumulative Y value by summing Y incremental at alower scale.

The incremental value at the increased scale factor may be used toderive a cumulative Y for each respective coordinate X values byiteratively incrementing Y increment by Y increment to produce a firstcumulative Y and then incrementing that first cumulative Y with the Yincremental value and so on to produce a series of distinct cumulative Yvalues at the higher scale factor for each X coordinate. The discretecumulate Y values may then be reduced by the scale factor to the scaleof the numerator (dx) before shifting and added to the initial Ycoordinate value to produce the correct Y coordinate for each respectiveX coordinate. By producing the cumulative Y using Y increment at theincreased scale factor, cumulative errors in the Y coordinate value dueto an error in the cumulative Y value due to the lower scale factor of Yincrements are avoided.

An example is shown in Table III. In the preferred embodiment, a radix 2machine is used with locations of 16 bits each used and with the mostsignificant or 16th bit being used for a sign bit. The Y register,therefore, corresponding to a first data word of 120 would be 0000 00000111 1000. As the leftmost or most significant bit of the register isnot available for indicating the numerical value, as it is a sign bit inthe preferred embodiment, then the first data word expressed in binary,may be shifted to the left in the direction of the most significantbits, a total of eight places corresponding to the eight zeros or unusedbinary bit positions to the left of "111 1000." The updated first dataword, as shown in the register is now 01111000000000000 corresponding toa decimal value of 30,720.

The denominator corresponding to the distance between the end points ina second coordinate direction and to the second data word is the binaryword 0000 0000 0011 0010 equal to a decimal value of 50. The quotientproduced by the division of the dividend or first data word by thedenominator or second data word produces a quotient having a number ofbits related to the number of bits in the dividend reduced by the numberof bits in the divisor or denominator. In the divisor, the mostsignificant bit is in the 6th bit position corresponding to a decimal 2⁵or decimal of 32. The numerator corresponding to the first data word andexpressed as the 16 bit binary word 0111 1000 0000 0000 may be raised byan order of the radix, (i.e. 2⁵) corresponding to the order of the mostsignificant bit position of the denominator, with the assurance that thequotient will fit within the register size containing the first dataword after shifting above and without loss of any significant bits inthe quotient, such as, for example, bit corresponding to the remainder.

To summarize the foregoing, the precision of data word for the numeratorvalue, used in deriving the slope can be raised within the spaceallotted by a machine register by shifting the significant bits of thatdata word to the left or towards the most significant bit in theregister equal to the number of unused bits in the register or in theexample between the most significant bit position for the first dataword shown, or seventh bit position and the most significant bitposition available in the register. This causes the binary wordcorresponding to the numerator to be stated at its highest value therebyavoiding floating point arithmetic. The precision of the slope used inlinear interpolation may be further increased by expanding the registerspace available for storing that binary word and shifting hat first dataword to the left, effectively raising it by a power of the radix used,corresponding to the number of significant bits in the denominator ordivisor. As stated above, as the slope is the quotient produced by thedivision of the dividend or numerator (first data value), by the divisoror denominator (second data value), a shift of the numerator by thenumber of significant bits in the denominator, after division produces aquotient having a number of significant bits no greater than thedividend. In this way, the precision of the quotient or incrementalvalue in the first coordinate direction is maintained equal to theprecision of a numerator.

To continue with the example above, as the divisor contains 6significant bits corresponding in binary notation to it 2⁵ or 32 thenthe numerator may be shifted to the left for a total of 13 places byincreasing the scale, raising the value of the first data word by ascale factor of 2¹³. As 2¹³ equals decimal 8192, the arithmeticaccomplished in binary form and expressed in decimal is ##EQU4##

The first coordinate or Y incremental value is expressed in decimal as19,660/8192=2.399902 or 4CCC in HEX. The actual incremental valuedefined by the coordinate end points is 120/50=2.4. The differencebetween the Y incremental value, expressed as a third data word and theactual slope is 4×10⁻³ % error. As shown in Table III, the Y incrementalproduced at the higher precision is used to iteratively increment Y,which is then reduced in scale accordingly and added to the first endpoint in the first coordinate direction (Y direction) and that Ycoordinate value is stored. In reducing the scale, the Y value may betruncated or rounded, to produce an intercept value, for example. Asshown in Table III below, the intercept value is shown as produced bytruncation and rounding.

Additionally, to increase the speed of the process, the value of thefirst data word or numerator may be compared to successive entries in anordered set of values. By a comparison of the value of the first dataword it can quickly be determined whether the coordinate difference(i.e. Y₂ -Y₁) is greater or lesser than a value in a particular positionof the set of values. Accordingly, the set of values may be arranged indecreasing orders of the machine radix, (i.e. 2¹³, 2¹², . . . 2⁰). By asuccessive process of comparison in the decreasing order, it can easilybe determined where in this procedure, the first data word in the firstmachine location is less than a value in the set of values. Then thatparticular value in the set of values could be referenced to an indexvalue to indicate the number of bits available in the numerator registerfor shifting the first data word. It should be noted that according tothe principles of the invention, it is not necessary where thedenominator is a power of two, such as two or four, to divide, savingadditional time, as shifting of the numerator accomplishes the sameresult.

Accordingly, the above process is equally valid for the reverse processwhere the set of values is in increasing order and the comparison is inthe increasing order with the particular value of interest in the setbeing the first greater than the first data word.

In this way, it is possible to avoid floating point arithmetic byincreasing the value of the numerator and corresponding to the number ofunused bits available in the register for shifting while furtherincreasing the value of the numerator corresponding to the number ofsignificant bits in the denominator to maintain the power of two of themost significant bit of the quotient equal to the power of two of themost significant bit of the dividend and thereby increasing theprecision of the quotient and the answer. Additionally, it is possibleto use a set of values such as a look up table for example, to comparethe value of the numerator to values in the denominator, selecting as anindex number related to a value in said set of values to indicating thenumber of positions available for shifting the numerator by arrangingthe set of values in an order of values corresponding to decreasing orincreasing orders of the radix and successively comparing the numeratorvalue in the order of said decreasing or increasing powers of the radixuntil a particular value is found which is greater or less, respectivelythan the numerator value. That particular value can then correspond toan index value corresponding to the power of two available in theregister for shifting the numerator and increasing its value by a powerof two.

As would be apparent to those skilled in the art, the inventiveprinciples can be applied to any radix system or to any coordinatesystem.

                  TABLE III                                                       ______________________________________                                        Start Point                                                                   X.sub.1 ,Y.sub.1 = 0,0 Y incremental = 19660 dec.;                            End Point  Delta --X = 50                                                                            4CCC Hex                                               X.sub.2 ,Y.sub.2 = 50,120                                                                Delta --Y = 120                                                                           Scale Factor = 105134 dec.                             ______________________________________                                        (truncated)                                                                           (rounded)  Cumulative incremental                                     X,Y     Y          Y per X coordinate                                         ______________________________________                                         1,2    [2]         Sum=     19660 =                                                                               4CCChex                                   2,4    [5]        Sum=      39320 =                                                                              9998hex                                    3,7    [7]        Sum=      58980 =                                                                              E664hex                                    4,9    [10]       Sum=      78640 =                                                                              13330hex                                   5,11   [12]       Sum=      98300 =                                                                              17FFChex                                   6,14   [14]       Sum=     117960 =                                                                              1CCC8hex                                   7,16   [17]       Sum=     137620 =                                                                              21994hex                                   8,19   [19]       Sum=     157280 =                                                                              26660hex                                   9,21   [22]       Sum=     176940 =                                                                              2B32Chex                                  10,23   [24]       Sum=     196600 =                                                                              2FFF8hex                                  11,26   [26]       Sum=     216260 =                                                                              34CC4hex                                  12,28   [29]       Sum=     235920 =                                                                              39990hex                                  13,31   [31]       Sum=     255580 =                                                                              3E65Chex                                  14,33   [34]       Sum=     275240 =                                                                              43328hex                                  15,35   [36]       Sum=     294900 =                                                                              47FF4hex                                  16,38   [38]       Sum=     314560 =                                                                              4CCC0hex                                  17,40   [41]       Sum=     334220 =                                                                              5198Chex                                  18,43   [43]       Sum=     353880 =                                                                              56658hex                                  19,45   [46]       Sum=     373540 =                                                                              5B324hex                                  20,47   [48]       Sum=     393200 =                                                                              5FFF0hex                                  21,50   [50]       Sum=     412860 =                                                                              64CBChex                                  22,52   [53]       Sum=     432520 =                                                                              69988hex                                  23,55   [55]       Sum=     452180 =                                                                              6E654hex                                  24,57   [58]       Sum=     471840 =                                                                              73320hex                                  25,59   [60]       Sum=     491500 =                                                                              77FEChex                                  26,62   [62]       Sum=     511160 =                                                                              7CCB8hex                                  27,64   [65]       Sum=     530820 =                                                                              81984hex                                  28,67   [67]       Sum=     550480 =                                                                              86650hex                                  29,69   [70]       Sum=     570140 =                                                                              8B31Chex                                  30,71   [72]       Sum=     589800 =                                                                              8FFE8hex                                  31,74   [74]       Sum=     609460 =                                                                              94CB4hex                                  32,76   [77]       Sum=     629120 =                                                                              99980hex                                  33,79   [79]       Sum=     648780 =                                                                              9E64Chex                                  34,81   [82]       Sum=     668440 =                                                                              A3318hex                                  35,83   [84]       Sum=     688100 =                                                                              A7FE4hex                                  36,86   [86]       Sum=     707760 =                                                                              ACCB0hex                                  37,88   [89]       Sum=     727420 =                                                                              B197Chex                                  38,91   [91]       Sum=     747080 =                                                                              B6648hex                                  39,93   [94]       Sum=     766740 =                                                                              BB314hex                                  40,95   [96]       Sum=     786400 =                                                                              BFFE0hex                                  41,98   [98]       Sum=     806060 =                                                                              C4CAChex                                  42,100  [101]      Sum=     825720 =                                                                              C9978hex                                  43,103  [103]      Sum=     845380 =                                                                              CE644hex                                  44,105  [106]      Sum=     865040 =                                                                              D3310hex                                  45,107  [108]      Sum=     884700 =                                                                              D7FDChex                                  46,110  [110]      Sum=     904360 =                                                                              DCCA8hex                                  47,112  [113]      Sum=     924020 =                                                                              E1974hex                                  48,115  [115]      Sum=     943680 =                                                                              E6640hex                                  49,117  [118]      Sum=     963340 =                                                                              EB30Chex                                  50,120  [120]      Sum=     983000 =                                                                              EFFD8hex                                  ______________________________________                                    

The effect of shifting to increase the scale of the Y increment is toeliminate the binary point in a third data word representing the slopeand Y increment and thereby avoiding floating point arithmeticoperations. The binary point separates the bit locations separatingfractional from integer values in a data word (i.e. having values equalto or greater than 1 and less than 1 (i.e. between the bit positions "2⁰" and "2⁻¹ ". The binary point is equivalent to the decimal point in aradix 10 system and equivalent to a "point" between those machinepositions having a value equal to or greater than 1 and less than one inany system and separating the fractional values from the integer valuesin the slope or Y increment value.

By shifting in the direction of more significant bits, the scale factorof Y increment is increased, thereby moving the "point" effectively inthe direction of the less significant bits. If a sufficient number ofbit positions are shifted, the binary point is eliminated from Yincrement. In this way, floating point arithmetic is avoided. The valueof Y increment at the increased scale factor may be used to derive acumulative Y for each respective coordinate X values by iterativelyincrementing Y increment by Y increment to produce a first cumulative Yand then incrementing that first cumulative Y with Y increment and so onto produce a series of distinct cumulative Y values at the higher scalefactor for each X coordinate. The discrete cumulate Y values may then bereduced by the scale factor to the scale of the numerator (dx) beforeshifting and added to the initial Y coordinate value to produce thecorrect Y coordinate for each respective X coordinate. By producing thecumulative Y using Y increment at the increased scale factor, errors inthe Y coordinate value due to an error in the cumulative Y increment dueto the lower scale factor of Y increment are avoided.

The compiler used in the preferred embodiment to perform the methoddescribed herein is shown in the program listings written in Motorola68000 assembler language and contained within six modules. These programlistings are shown in U.S. Pat. No. 4,623,977 issued Nov. 18, 1986 andcommonly assigned, and whose disclosure is specifically incorporated byreference herein.

The first module is the main program utilizing the control modules shownas modules 2-7. Its function is to access the pack data and interpretthe knot locations and control codes therein.

Module 2 is a subset of module 1 and is used to evaluate each completeinformation set, identifying the Case and control code value thereof.

Module 3 is the compiler described earlier, which functions according toequations 3.1 and 3.2. and which compiles the knot locations, the anglesof the curve at the knots, and the related values of the parameter t toproduce the node locations on the curve segment locus.

Module 4 is the compiler which operates according to the method ofauto-scaling linear interpolation shown herein.

Module 5 is a module which receives curve coordinate data, correspondingto the display coordinate system and sorts this data in the order of theraster lines on the display, so that the display data is accessed intimed relation to the generation of the raster lines, with data fordisplay on any one particular raster line accessed in time with thelocation of the imaging beam at that raster line.

Module 6 is a general purpose memory allocation and release mechanismfor buffer and raster line data.

Module 7 is an apparatus for performing general trigonometry.

As said, these modules are written in 68000 assembler code as used inthe preferred embodiment to perform the invention as described. Thelanguage for the preferred embodiment is further compiled into machineobject language for use on the Motorola 68000.

What is claimed is:
 1. A method of creating a data base on a storagemedia including the steps of encoding the data in a computer memory,said data representing knots on an outline defined relative to acoordinate plane and for generating a series of signals representingnodes on the locus of a curve partially defined by said set of knots,the method including, the steps of:(a) selecting sets of coordinates onsaid outline, to represent said knots, (b) establishing a successiveorder of said knots, and (c) encoding said knots in a data order incomputer memory indicative of said knot order, and said step (c) ofencoding on a storage media a complete information set of data providinga code indicative of a predetermined shape of said outline between apair of said knots or a complete information set providing thecoordinate distances between adjacent knots.
 2. The method of claim 1,where said interknot angles of step (e) are a first interknot angle B₁formed from a first selected related knot (Z_(b)), to said first knot(Z_(a)) and wherein said first selected related knot is adjacent to saidfirst knot in said successive order and a second interknot angle B₂formed from said first knot to a second selected related knot (Z_(c)),and wherein said second selected related knot is adjacent to said firstknot in said successive order.
 3. The method of claim 2, wherein saidfirst knot (Z_(a)) is successive to said first related selected relatedknot (Z_(b)) in said outline loop and said second selected related knot(Z_(c)), is successive to said first knot (Z_(a)) in said outline loopand said step (e) of of deriving an average angle includes the step (x)of deriving the average of the interknot angles B₁ and B₂.
 4. The methodof claim 3, wherein said second angle at said second knot (Z_(b)) is θand said first angle at said first knot (Z_(a)) is φ, and said step (g)includes the step (y) of establishing said compiler according to theform

    Z(t)=Z.sub.b +(3t.sup.2 -2t.sup.3)(Z.sub.a -Z.sub.b)+r*t(1-t).sup.2 S.sub.1 -s*t.sup.2 (1-t)S.sub.2 ;

where S₁ =e^(i)θ (Z_(a) -Z_(b)); S₂ =e^(-i)φ (Z_(a) -Z_(b)); 0<=t<=1 andwhere Z_(a) is the said first knot and Z_(b) is the said second knot andr and s are positive real numbers.
 5. The method of claim 4, whereinsaid angle θ is an entrance angle for said curve at said second knot(Z_(b)), and said angle φ is an exit angle for said curve at said firstknot (Z_(a)).
 6. The method of claim 4, wherein: ##EQU5##
 7. The methodof claim 1, wherein step (d) includes the step (ah), wherein saidcomplete information set provides a code indicative of a predeterminedshape of said outline between a pair of knots of generating a series ofsignals representing nodes on a locus of a curve outline partiallydefined by a set of related ones of said knots, said knots defining theend points of respective segments of said curve outline locus and ofencoding said node signals as data for use when representing said curvesegments in a separate additional process responsive to the shape ofsaid curve outline locus, as represented by said encoded node signals.8. The method of claim 7, including the steps of:(i) for a first knot,(Z_(a)), representing a first end point of a first curve segment,deriving a first angle, indicative of the average of the interknotangles between said first knot (Z_(a)), and selected related knots andencoding as data, signals indicative of said first angle, (ii) at asecond of said knots (Z_(b)), representing a second end point of saidfirst curve segment, establishing a second angle for said first curvesegment, and encoding as data, signals indicative of said second angle,(iii) establishing a compiler for compiling data according to a cubicparametric polynomial relationship between a parameter "t", said knotsand angles at the said end points of a said curve segment and the locusof a said curve segment, (iv) establishing a range "R" of values forsaid parameter "t", (v) applying said signals indicative of the saidlocations of said first and second knots of said first curve segment, tosaid compiler, (vi) applying said signals indicative of the said firstand second angles of said first curve segment to said compiler, (vii)applying a signal indicative of a distinct selected value of saidparameter "t" within said range "R", to said compiler to derive a signalindicative of a respective node location on said first curve segment,(viii) repeating step (vii) by applying signals indicative of additionaldistinct selected values of said parameter "t", within said range "R",to derive a plurality of signals indicative of respective node locationson said locus of said first curve segment for respective distinctselected values of said parameter "t", (ix) encoding said signalsderived in step (vii) and (viii), in a data base to represent said firstcurve segment.
 9. The method of claim 8, including the step (x) ofrepeating steps (i) through (xii) for at least at second curve segmentwithin the said locus of said curve.
 10. The method of claim 8, whereinsaid step (iii) of establishing said compiler includes the step (xi) ofestablishing said compiler in a Hermite form.
 11. The method of claim 1,wherein said step (k) includes the step (s) of establishing anincremental value of said parameter "t" and applying a multiple of saidincremental value as said distinct selected value.
 12. The method ofclaim 11, wherein said step (a) of selecting the said sets ofcoordinates to represent said knots includes the step (t) of definingsaid knot locations with reference to an encoding grid having first andsecond coordinates and said step (s) includes the step (u) ofestablishing said incremental value of said parameter "t" as a multipleof the reciprocal of the distance between said first and second knots.13. The method of claim 1, wherein said means (b) of establishing asuccessive order of said knots, defines an outline loop and step (m) ofencoding said knot signals includes the step (v) of encoding said knotsignals in a data order defining a data loop, which is indicative of thesaid knot order and said outline loop, respectively.
 14. The method ofclaim 13, wherein step (m) includes the step (w) of encoding said nodesignals in an order in said data loop, indicative of the order of saidnodes with respect to the said knot order in the said outline loop. 15.The method of claim 1, wherein said step (d) includes the step (af) ofencoding said complete information set in a data order indicative of thesaid knot order and as a series of data words, with a designated part ofsaid series providing a control code value, indicative of said controlcode.
 16. The method of claim 15, wherein said step (af) includes thestep (ag) of encoding said designated series of said data words at thebeginning of the complete information set, relative to said data order,and of encoding said data words as a predetermined number of data bitsfor each data word and said designated series is the first one or moreof said data words in said series of data words.
 17. The method of claim1, wherein said step (d) includes the step (e) wherein responsive tosaid complete information set providing the coordinate distances betweenadjacent knots and for a first knot, (Z_(a)), representing a first endpoint of a first curve segment, deriving a first angle, indicative ofthe average of an interknot angle between said first knot (Z_(a)), andselected related knots and encoding as data in computer memory, signalsindicative of said first angle,(f) at a second of said knots (Z_(b)),representing a second end point of said first curve segment,establishing a second angle for said first curve segment, and encodingas data in the computer memory, signals indicative of said second angle,(g) establishing a compiler in computer memory, which compiler generateslocus points for compiling data according to predetermined cubicparametric polynomial function between a parameter "t", said knots andangles at said end points of a said curve segment, and the locus of asaid curve segment, (h) establishing a limited range "R" of values forsaid parameter "t" in the compiler, (i) in the computer memory, applyingsaid signals indicative of said locations of said first and second knotsof said first curve segment, to said compiler, (j) applying said signalsindicative of said first and second angles of said first curve segmentto said compiler, (k) applying a signal indicative of a distinctselected value of said parameter "t" within said range "R", to saidcompiler to derive a signal indicative of a respective node location onsaid first curve segment, (l) repeating step (h) by applying signalsindicative of additional distinct selected values of said parameter "t",within said range "R", to derive a plurality of signals indicative ofrespective node locations on said locus of said first curve segment forrespective distinct selected values of said parameter "t", (m) encodingsaid signals derived in step (k) and (l), in a data base in memory forlater sorting to represent said first curve segment for later generationof a visual representation of said curve by using said data signalsdirectly to control a display process and visually display the pattern.18. The system of claim 1, including the step (m) of repeating steps (e)through (m) for at least a second curve segment within the said locus ofsaid curve.
 19. The method of claim 1, wherein said step (g) ofestablishing said compiler includes the step (o) of establishing saidcompiler in memory in A Hermite form.
 20. The method of claim 1, whereinsteps (e) and (f) include (m) the step (p) of referencing said first andsecond angles of said first curve segment, to a first of said interknotangles between said second knot (Z_(b)), and said first knot (Z_(a)).21. The method of clam 1, wherein step (a) for selecting the said setsof coordinates to represent said knots includes the step (q) of definingsaid knots locations with reference to an encoding grid having first andsecond coordinates and said step (h) of establishing a range "R" ofvalues for said parameter "t" includes the step (r) of defining saidvalues independently of said first and second coordinates.
 22. Themethod of claim 1, wherein said step (a) includes the step (z) ofencoding the coordinate positions of said knots with regard to anormalized encoding grid defining an outline loop at a normalized sizeand generating scaled knot coordinates with regard to a displaycoordinate grid, defining the said outline loop at said scaled size. 23.The method of claim 1, wherein said step (d) includes the step of (aa)wherein said complete information set provides a code indicative of apredetermined shape of said outline between a pair of knots, of encodingsaid control code value as indicative of a cusp formed at a first knotand wherein the exit angle (g) of said outline at said first knot issubstantially the interknot angle (B) between a preceding knot in saidknot order and said first knot and the outline between said knot andsaid preceding knot is a straight line.
 24. The method of claim 1,wherein said step (d) includes the step (ab) of encoding said controlcode value as indicative of a smooth outline at a first knot and whereinthe entrance angle (a) of said outline at said first knot issubstantially the interknot angle (B) between a preceding knot and saidfirst knot, said outline between said preceding knot at said first knotis a straight line and said outline between said first knot and asucceeding knot is a smooth continuous curve.
 25. The method of claim 1,wherein said step (d) includes the step (ac), wherein said completeinformation set provides a code indicative of a predetermined shape ofsaid outline between a pair of knots, of encoding said control codevalue as indicative of a smooth knot outline at a first knot and whereinthe angle (g) of said outline is substantially the interknot anglebetween said first knot and a successive knot and said outline betweensaid first knot and said successive knot in a straight line and saidoutline between said first knot and a preceding knot is a smoothcontinuous curve.
 26. The method of claim 1, wherein said step (d)includes the step (ad), wherein said complete information set provides acode indicative of a predetermined shape of said outline between a pairof knots, of encoding said control code value as indicative of a cusp ata first knot, and wherein said outline is a smooth continuous curvebetween said first knot and a successive knot, and said angle (θ) ofsaid smooth continuous curve outline at said first knot is substantiallythe angle (θ) of said outline at said successive knot, with respect tothe interknot angle (B) between said first knot and said successiveknot, and said outline between said first knot and a preceding knot is astraight line.
 27. The method of claim 1, wherein step (d) includes thestep (ae), wherein said complete information set provides a codeindicative of a predetermined shape of said outline between a pair ofknots, of encoding said control code value indicative of a cusp at afirst knot, wherein said outline is a smooth continuous curve betweensaid first knot and a preceding knot and a straight line between saidfirst knot and a succeeding knot and the angle (φ) of said smoothcontinuous outline at said first knot is substantially that of the angle(θ) of said outline is said preceding knot, with respect to theinterknot angle (B) between said preceding knot and said first knot.